1005

// OK Tumus 1005 brute force https://acm.timus.ru/problem.aspx?space=1&num=1005

# include <iostream>
# include <vector>
using namespace std;

void gen(vector<size_t> &m, size_t cur_i, vector<size_t> bits, size_t &n, size_t &res) {
    if (cur_i == n) {
        size_t sum[2] = {0, 0};
        for (size_t i = 0; i < n; i++) {
            sum[bits[i]] += m[i];
        }
        res = min(res, static_cast<size_t>(abs(static_cast<int32_t>(sum[0] - sum[1]))));
    }
    else {
        bits.push_back(0);
        gen(m, cur_i + 1, bits, n, res);
        bits.pop_back();
        bits.push_back(1);
        gen(m, cur_i + 1, bits, n, res);
    }
}
int main() {
    size_t n;
    cin >> n;
    vector<size_t> m(n);
    vector<size_t> bits;
    size_t result = 1000000000;
    for (size_t i = 0; i < n; i++) {
        cin >> m[i];
    }
    gen(m, 0, bits, n, result);
    cout << result;
    return 0;
}