#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
int n;
int a[N];
int cnt;
int mid,s,t;
signed main (){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
cnt=0;//有多组数据初始化
for(int i=1; i<=n; i++){
scanf("%d",&a[i]);
cnt+=a[i];//求和
}
if(n==1||n==2){//判断无解情况
printf("-1\n");
continue;
}
sort(a+1,a+n+1);//排序
mid=a[(n/2)+1];
mid=mid*2*n+1;
printf("%d\n",max(0LL,mid-cnt));
}
return 0;
}