#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 rng(random_device{}()); 
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

map<vector<PII>,bool> dp[2];
int n;
bool win(vector<PII> x,int a) {
	sort(all(x)); x.erase(unique(all(x)),x.end());
	if (!x.empty()&&x[0]==mp(0,0)) return false;
	if (dp[a].count(x)) return true;
	if (x.empty()) return dp[a][x]=true;
	//printf("? %d\n",SZ(x));
	if (a==0) {
		for (auto [p,q]:x) if (p==q) return dp[a][x]=false;
		vector<PII> y1,y2;
		for (auto p:x) {
			if (p.fi>0) y1.pb(mp(p.fi-1,p.se));
			if (p.se>0) y2.pb(mp(p.fi,p.se-1));
		}
		return win(y1,1)||win(y2,1);
	} else {
		for (auto &[p,q]:x) if (p<q) --q; else --p;
		return win(x,0);
	}
}
void solve() {
	scanf("%d",&n);
	dp[0].clear();
	dp[1].clear();
	vector<PII> p;
	rep(i,0,n) {
		int x,y;
		scanf("%d%d",&x,&y);
		p.pb(mp(x,y));
	}
	puts(win(p,0)?"Yes":"No");
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}