#include<bits/stdc++.h>
using namespace std;
int a[1000],b[1000],sum,n,s,d,MIN;
void dfs(int r)
{
for(int i=s;i<n;i++)
{
if(!b[i])
{
b[i]=1;
sum-=a[i];s=i;
if(MIN>abs(sum-d+sum))
{
MIN=abs(sum-d+sum);
}
dfs(r+1);
sum+=a[i];b[i]=0;
}
}
}
int main()
{
while(~scanf("%d",&n))
{s=0;
sum=0;MIN=999999;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}d=sum;
dfs(1);
printf("%d\n",MIN);
}
return 0;
}