#include<iostream>#include<cstdio>#include<math.h>#include<algorithm>using namespace std;int a[25], Asum, mi;void dfs(int sum, int i){    if(i < 0)                //西瓜已经试装完，返回        return;    int t = fabs(Asum - 2 * sum);  //两兄弟所分西瓜重量之差    if(t < mi)        mi = t;    if(2 * sum - Asum >= mi)  //剪枝，重量之差已大于或等于已求最小值，往后再搜还是大于或等于        return;    dfs(sum + a[i], i - 1);    //装第 i 个    dfs(sum, i - 1);          //不装第 i 个}int main(){    int n;    while(scanf("%d", &n) != EOF)    {        Asum = 0;        mi = 99999999;        for(int i = 0; i < n; i ++)        {            scanf("%d", &a[i]);            Asum += a[i];        }        dfs(0, n - 1); //从什么都不装，对最后一个西瓜决策开始        cout <<mi <<endl;    }    return 0;}