codejam b

#include <bits/stdc++.h>
using namespace std;

int main() {
	int t, n;
	pair<int, int> arr[100007];
	cin >> t;
	int cs = 0;
	while(t--) {
		cs++;
		int x;
		cin >> n;
		for(int i = 0; i < n; i++) {
			cin >> x;
			arr[i] = make_pair(x, i);
		}
		sort(arr, arr + n);
		bool psbl = true;
		int i = 0;
		while(i < n) {
			int unsorted[3] = {0};
			int sorted[3] = {0};
			sorted[i % 3] ++;
			sorted[arr[i].second % 3]++;
			for(j = i + 1; j < n && arr[j].first == arr[i].first; j++) {
				sorted[j % 3]++;
				unsorted[arr[j].second % 3]++;
			}
			j = i;
			for(int k = 0; k < 3; k++) {
				if(unsorted[k] != sorted[k]) psbl = false;
			}
			if(!psbl) break;
		}
		if(psbl) printf("")

	}
	return 0;
}