1 #pragma comment(linker, "/STACK:1024000000,1024000000")
2 #include<iostream>
3 #include<cstdio>
4 #include<cstring>
5 #include<cmath>
6 #include<math.h>
7 #include<algorithm>
8 #include<queue>
9 #include<set>
10 #include<bitset>
11 #include<map>
12 #include<vector>
13 #include<stdlib.h>
14 #include <stack>
15 using namespace std;
16 #define PI acos(-1.0)
17 #define max(a,b) (a) > (b) ? (a) : (b)
18 #define min(a,b) (a) < (b) ? (a) : (b)
19 #define ll long long
20 #define eps 1e-10
21 #define MOD 1000000007
22 #define N 1000000
23 #define inf 1e12
24 int n;
25 int a[N];
26 int sum;
27 int ans;
28 void dfs(int cur,int num){
29 if(cur==n){
30 return;
31 }
32 int t=abs(sum-num-num);
33 if(t<ans){
34 ans=t;
35 }
36 dfs(cur+1,num+a[cur]);
37 dfs(cur+1,num);
38 }
39 int main()
40 {
41 while(scanf("%d",&n)==1){
42 sum=0;
43 for(int i=0;i<n;i++){
44 scanf("%d",&a[i]);
45 sum+=a[i];
46 }
47 ans=inf;
48 dfs(0,0);
49 printf("%d
",ans);
50
51 }
52 return 0;
53 }