#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int L[N],R[N],deg[N],a[N],b[N];
vector<vector<int>> G;
void solve(){
	int n,res=1;cin>>n;
	G.clear();G.resize(n+10);
	fill(deg,deg+1+n,0);
	for (int i=1;i<=n;i++){
		cin>>L[i]>>R[i];
		G[L[i]].emplace_back(i);
		if (R[i]<n) G[R[i]+1].emplace_back(i);
		deg[i]+=1+(R[i]<n);
	}queue<tuple<int,int,int>> que;
	fill(a,a+1+n,0);fill(b,b+1+n,0);
	for (int i=1;i<=n;i++){
		if (deg[i]==1) que.emplace(i,L[i],1);
	}while (que.size()){
		auto [x,y,val]=que.front();que.pop();
		if (a[x]||b[y]) return cout<<"tie\n",void();
		a[x]=y,b[y]=x;res*=val;
		for (int v:G[y]){
			deg[v]--;
			if (deg[v]==1){
				if (y==L[v]) que.emplace(v,R[v]+1,-1);
				else que.emplace(v,L[v],1);
			}
		}
	}for (int i=1;i<=n;i++){
		if (!a[i]||!b[i]) return cout<<"0\n",void();
	}fill(b,b+1+n,0);int cnt=n;
	for (int i=1;i<=n;i++){
		if (b[i]) continue;
		for (int x=i;!b[x];x=a[x]) b[x]=1;
		cnt--;
	}if (cnt&1) res*=-1;
	if (res>0) cout<<"1\n";
	else cout<<"1\n";
	return;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(nullptr);cout.tie(nullptr);
	int t;cin>>t;while (t--) solve();
	return 0;
}