#include <bits/stdc++.h>
using namespace std;

template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}

int main() {
    int N;
    cin >> N;
    vector<int> R(N);
    for (int &r : R) cin >> r;
    if (N > 22) {
        cout << 0 << endl;
        return 0;
    }
    vector<int> eq;
    vector<vector<int>> pl(N, vector<int>());
    vector<vector<int>> mi(N, vector<int>());
    function<void(int, int, int)> frontexh = [&](int i, int dif, int sum) {
        if (i == N / 2) {
            if (dif == 0)
                eq.emplace_back(sum);
            else if (dif > 0)
                pl[dif].emplace_back(sum);
            else
                mi[-dif].emplace_back(sum);
        } else {
            frontexh(i + 1, dif, sum);
            frontexh(i + 1, dif + 1, sum + R[i]);
            frontexh(i + 1, dif - 1, sum - R[i]);
        }
    };
    frontexh(0, 0, 0);
    // 前半分だけを選んで0人のグループとなる場合を除去.
    eq.erase(eq.begin());
    sort(eq.begin(), eq.end());
    for (int i = 0; i < N; ++i) {
        sort(pl[i].begin(), pl[i].end());
        sort(mi[i].begin(), mi[i].end());
    }
    int ans = 1 << 30;
    for (auto &&e : eq) chmin(ans, abs(e));
    // 後ろ半分だけを選んで0人のグループとなる場合を除去.
    bool flag = false;
    function<void(int, int, int)> backexh = [&](int i, int dif, int sum) {
        if (i == N - N / 2) {
            if (dif == 0) {
                if (flag) chmin(ans, abs(sum));
                else flag = true;
                auto it = lower_bound(eq.begin(), eq.end(), -sum);
                if (it != eq.end()) chmin(ans, abs(sum + *it));
                if (it != eq.begin()) chmin(ans, abs(sum + *(--it)));
            } else if (dif > 0) {
                auto it = lower_bound(mi[dif].begin(), mi[dif].end(), -sum);
                if (it != mi[dif].end()) chmin(ans, abs(sum + *it));
                if (it != mi[dif].begin()) chmin(ans, abs(sum + *(--it)));
            } else {
                auto it = lower_bound(pl[-dif].begin(), pl[-dif].end(), -sum);
                if (it != pl[-dif].end()) chmin(ans, abs(sum + *it));
                if (it != pl[-dif].begin()) chmin(ans, abs(sum + *(--it)));
            }
        } else {
            backexh(i + 1, dif, sum);
            backexh(i + 1, dif + 1, sum + R[N / 2 + i]);
            backexh(i + 1, dif - 1, sum - R[N / 2 + i]);
        }
    };
    backexh(0, 0, 0);
    cout << ans << endl;
}