#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a,c) memset(a,c,sizeof(a))

#define DEBUG(x) cout<<"#x"<<": "<<x<<endl

using namespace std;

typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll INF = INT_MAX/3;
const ll MOD = 1000000007;
const double EPS = 1e-14;
const int dx[] = {1,0,-1,0} , dy[] = {0,1,0,-1};

int a[30];
int n;

int dfs(int x,int b,int c){
    if(x == n) return abs(b-c);
    int res = min(dfs(x+1,b+a[x],c) , dfs(x+1,b,c+a[x]));
    return res;
}

int main(){

    while(true){
	cin >> n;
	if(n == 0) break;
	REP(i,n){
	    cin >> a[i];
	}
	cout << dfs(0,0,0) << endl;
    }

    return 0;
}