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

int popcnt(int x) { return __builtin_popcount(x); }

constexpr int MAX = 25;
int fac[MAX];
void nCrinit() {
    fac[0] = 1;
    for (int i = 1; i < MAX; i++) {
        fac[i] = fac[i - 1] * i;
    }
}
int nCr(int n, int r) {
    if (n < r) return 0;
    if (n < 0 || r < 0) return 0;
    return fac[n] / fac[r] / fac[n - r];
}

int main() {
    int N;
    cin >> N;
    vector<int> R(N);
    for (int &r : R) cin >> r;
    if (N > 22) {
        cout << 0 << endl;
        return 0;
    }
    nCrinit();
    vector<vector<int>> comb(N, vector<int>());
    for (int i = 0; i < N; ++i) {
        comb[i].reserve(nCr(N, i + 1));
    }
    for (int i = 1; i < 1 << N; ++i) {
        int rsum = 0;
        for (int j = 0; j < N; ++j) {
            if (i >> j & 1) {
                rsum += R[j];
            }
        }
        comb[popcnt(i) - 1].emplace_back(rsum);
    }
    int ans = 1 << 30;
    for (int i = 0; i < N; ++i) {
        sort(comb[i].begin(), comb[i].end());
        for (int j = 0; j < comb[i].size() - 1; ++j) {
            ans = min(ans, abs(comb[i][j] - comb[i][j + 1]));
        }
    }
    cout << ans << endl;
}