#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <vector>
#include <map>
using namespace std;
#define MAX 202
#define MOD 1000000007
#define PB push_back
const int INF = 1000005;
typedef long long int LL;
typedef vector <int> vi;
vi *v;
int a[100];
int main()
{
int t,i,j,k,n,m;
int x,v,cur,best;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
sort(a,a+n);
best=INF;
for(i=0;i<n;i++)
{
bool h[5005];
memset(h,0,sizeof(h));
cur=0, h[0]=1;
for(j=0;j<n;j++)
{
if(i==j) continue;
cur= cur+a[j];
for(k=cur;k>=a[j];k--)
if(h[k-a[j]]) h[k]=1;
}
x=cur/2;
while(!h[x]) x--;
m=abs(cur-x-x);
if(m < best) best=m, v=a[i];
}
printf("%d %d\n",best,v);
}
return 0;
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGNzdHJpbmc+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPGxpc3Q+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxtYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKI2RlZmluZSBNQVggMjAyCiNkZWZpbmUgTU9EIDEwMDAwMDAwMDcKI2RlZmluZSBQQiBwdXNoX2JhY2sgCmNvbnN0IGludCBJTkYgPSAxMDAwMDA1Owp0eXBlZGVmIGxvbmcgbG9uZyBpbnQgTEw7CnR5cGVkZWYgdmVjdG9yIDxpbnQ+IHZpOwogCnZpICp2OwppbnQgYVsxMDBdOwogCmludCBtYWluKCkKewoJaW50IHQsaSxqLGssbixtOwoJaW50IHgsdixjdXIsYmVzdDsKCXNjYW5mKCIlZCIsJnQpOwoJd2hpbGUodC0tKQoJewoJCXNjYW5mKCIlZCIsJm4pOwoJCWZvcihpPTA7aTxuO2krKykJc2NhbmYoIiVkIiwmYVtpXSk7CgkJc29ydChhLGErbik7CgkJYmVzdD1JTkY7CgkJZm9yKGk9MDtpPG47aSsrKQkJCgkJewoJCQlib29sIGhbNTAwNV07CgkJCW1lbXNldChoLDAsc2l6ZW9mKGgpKTsKCQkJY3VyPTAsIGhbMF09MTsKCQkJZm9yKGo9MDtqPG47aisrKQoJCQl7CgkJCQlpZihpPT1qKQljb250aW51ZTsKCQkJCWN1cj0gY3VyK2Fbal07CgkJCQlmb3Ioaz1jdXI7az49YVtqXTtrLS0pCgkJCQkJaWYoaFtrLWFbal1dKQkJaFtrXT0xOwoJCQl9CgkJCXg9Y3VyLzI7CQoJCQl3aGlsZSghaFt4XSkJeC0tOwoJCQltPWFicyhjdXIteC14KTsKCQkJaWYobSA8IGJlc3QpCWJlc3Q9bSwgdj1hW2ldOwoJCX0KCQlwcmludGYoIiVkICVkXG4iLGJlc3Qsdik7Cgl9CglyZXR1cm4gMDsKfQ==