#include <bits/stdc++.h>
#define int long long
const int maxn = 1e4 + 5;

using namespace std;

int n,  a[maxn], f[maxn];

main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    if (fopen("chiakeo.INP", "r")){
        freopen("chiakeo.INP", "r", stdin);
        freopen("chiakeo.OUT", "w", stdout);
    }

    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i], f[i] = f[i - 1] + a[i];

    int l = 1, r = n, ans = LLONG_MAX;
    while (l <= r){
        int mid = (l + r) / 2;
        if (abs(f[n] - f[mid] - f[mid]) < ans){
            ans = abs(f[n] - f[mid] - f[mid]);
            r = mid - 1;
        }
        else l = mid + 1;
    }
    cout << ans;

    return 0;
}