#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;

#define all(x)  x.begin(),x.end()
#define v(x) vector<x>
#define nl '\n'
#define fxd(x) fixed << setprecision(x)
template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;


ll tot,n;
vector<ll> apples(21,0);

ll opt(ll cursum,ll i)
{
    if(i == n)
    {
        return abs(2*cursum-tot);
    }
    return min(opt(cursum+apples[i],i+1),opt(cursum,i+1));
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    cin >> n;
    
    for (int i = 0; i < n; i++)
    {
        cin >> apples[i];
        tot += apples[i];
    }
    cout << opt(0,0);
}