#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 1005
int a[N];
int d[50005];
int n;
int main(){
	int t, i, j;
	scanf("%d", &t);
	while (t--){
		memset(d, 0, sizeof(d));
		scanf("%d", &n);
		int sum = 0;
		for (i = 0; i < n; i++){
			scanf("%d", &a[i]);
			sum += a[i];
		}
		for (i = 0; i < n; i++){
			for (j = sum / 2; j >= a[i]; j--){
				d[j] = max(d[j], d[j - a[i]] + a[i]);
			}
		}
		int res = (sum / 2 - d[sum / 2]) * 2;
		if (sum % 2 != 0)
			res++;
		printf("%d
", res);
	}
	return 0;
}