#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define N 50007

int c[],dp[N];

int main()

{

    int t,n,i,v,V,sum;

    scanf("%d",&t);

    while(t--)

    {

        scanf("%d",&n);

        sum = ;

        memset(dp,,sizeof(dp));

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

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

        V = sum/;

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

        {

            for(v=V;v>=c[i];v--)

                dp[v] = max(dp[v],dp[v-c[i]]+c[i]);

        }

        int maxi = -;

        for(i=;i<=V;i++)

            maxi = max(maxi,dp[i]);

        printf("%d\n",abs(sum-*maxi));

    }

    return ;

}