#include signed main() { int n,m,X[1000]={0},Y[1000]={0},A[1000]={0},B[1000]={0},dis[1000][1000]={0}; while ( ~scanf("%d",&n) ) { for ( int i=1;i<=n;i++ ) scanf("%d %d",&X[i],&Y[i]); scanf("%d",&m); for ( int i=1;i<=m;i++ ) scanf("%d %d",&A[i],&B[i]); for ( int i=1;i<=m;i++ ) for ( int j=1;j<=m;j++ ) dis[i][j]=1<<29; for ( int i=1;i0 ) f2=false; if ( !f1 and !f2 ) break; } if ( f1 ) dis[i][j]=1; if ( f2 ) dis[j][i]=1; } for ( int k=1;k<=m;k++ ) for ( int i=1;i<=m;i++ ) for ( int j=1;j<=m;j++ ) dis[i][j]=std::min(dis[i][j],dis[i][k]+dis[k][j]); int ans=1<<29; for ( int i=1;i<=m;i++ ) ans=std::min(ans,dis[i][i]); if ( ans==(1<<29) ) puts("ToT"); else printf("%d\n",m-ans); } return 0; }