#include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vint;
static const int INF=1<<24;

template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
	v.assign(a,vector<T>(b,t));
}

//v.erase(unique(v.begin(),v.end()),v.end());

vint v;
ll ans;
ll a,b;
void foo(ll c){
	if(c==v.size()){
		ans=min(ans,abs(a-b));
		return;
	}
	a+=v[c];
	foo(c+1);
	a-=v[c];
	b+=v[c];
	foo(c+1);
	b-=v[c];
}

int main(){
	int n;
	while(cin>>n,n){
		v.clear();
		ans=INF;
		a=0;
		b=0;
		rep(i,n){
			ll t;
			cin>>t;
			v.PB(t);
		}
		foo(0);
		cout<<ans<<endl;
	}
}