1.GD-S0***4

#include<bits/stdc++.h>
using namespace std;
long long t,n,a[100005],col[100005],vis[1005][1005],mx;
void dfs(int i){
	if(i>n){
		long long cnt=0;
		for(int i=1;i<=n;i++){
			int ans=0;
			for(int j=i-1;j>=1;j--){
				if(!vis[j][i]&&a[i]==a[j]&&col[i]==col[j]){
					ans=a[i];
					vis[i][j]=vis[j][i]=1;
					break;
				}
			}
			cnt+=ans;
		}
		mx=max(mx,cnt);
		return;
	}
	col[i]=1;
	dfs(i+1);
	col[i]=0;
	dfs(i+1);
	return;
}
int main(){
	freopen("color.in","r",stdin);
	freopen("color.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
		}
		cout<<"0\n";
	}
	return 0;
}
f**k you ccf
f**k you mote