代码：

#include<bits/stdc++.h>
using namespace std;
struct tea{
	int x,y;
}a[51];
bool cmp(tea xx,tea yy)
{
	return xx.y<yy.y;
}
bool cmp1(tea xx,tea yy)
{
	return xx.x<=yy.x;
}
int main()
{
	int g;cin>>g;
	while(g--)
	{
		int n,x=0,f=0,d=1,any=0;cin>>n;
		for(int i=1;i<=n;i++)
		cin>>a[i].x>>a[i].y;
		sort(a+1,a+1+n,cmp1);
		for(int i=1;i<n;i++)
		{
			if(a[i].x==a[i+1].x&&a[i].y!=a[i+1].y)
			{
				cout<<"Notabletocatch"<<endl;
						f=1;break;
			}
		}
		if(f)continue;
		sort(a+1,a+1+n,cmp);any=a[n].y;
		for(int i=1;i<=any;i++)
		{
			if(a[d].x<x)x--;
			if(a[d].x>x)x++;
			for(int j=1;j<=n;j++)
			{
				a[j].y--;
				if(a[d].y<=0)
				{
					if(a[d].x!=x)
					{
						cout<<"Notabletocatch"<<endl;
						f=1;break;
					}
					else d++;
				}
			}
			if(f)break;
		}
		if(!f)cout<<"Abletocatch"<<endl;
	}
	return 0;
}