sg表很好打，规律很不好找。。。。
#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define pii pair<int,int>
#define piii pair<int, pair<int,int> > using namespace std; const int N = 1e5 + ;
const int M = 1e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-; int sg(int i, int j) {
if((i & ) && (j & )) return ;
return sg(i + >> , j + >> ) + ;
}
int n;
int main() {
int T; scanf("%d", &T);
while(T--) {
int ans = ;
scanf("%d", &n);
for(int i = ; i <= n / ; i++) {
int x, y; scanf("%d%d", &x, &y);
ans ^= sg(x, y);
}
if(ans) puts("YES");
else puts("NO");
}
return ;
} /*
*/