#include<bits/stdc++.h>
using namespace std;
int n,t,s,m;
struct node
{
    int x,y;
}a[55];
bool cmp(node a,node b)
{
    return a.y<b.y;
}
int main()
{
    cin>>t;
    while(t--)
    {
        s=m=0;
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>a[i].x>>a[i].y;
        sort(a+1,a+n+1,cmp);
        for(int i=1;i<=n;i++)
            if(fabs(s-a[i].x)>a[i].y)
            {
                cout<<"Notabletocatch"<<endl;
                break;
            }
            else
            {
                s=a[i].x;
                for(int j=i+1;j<=n;j++)
                    a[j].y-=fabs(s);
                m++;
            }
        if(m==n)
            cout<<"Abletocatch"<<endl;
    }
}