3

3

1

2

2

2

10

0

8

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <algorithm>

using namespace std;

int f[2600];

int main()

{

    int n;

    int p[150];

    int i, j;

    while(scanf("%d", &n)!=EOF)

    {

        int sum=0;

        for(i=0; i<n; i++)

            scanf("%d", &p[i] ), sum+=p[i];

        if(n==1)

        {

            printf("-1\n");

            continue;

        }

        memset(f, 0, sizeof(f));

        int dd=sum;

        sum=sum/2;

        //背包不一定要装满

        for(i=0; i<n; i++)

        {

            for(j=sum; j>=p[i]; j--)

                f[j] = max(f[j], f[j-p[i]]+p[i] );

        }

        dd=dd-f[sum];

        printf("%d\n", abs(f[sum]-dd) );

    }

    return 0;

}