//Δ_1001
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 555;
struct node{
    int x,y;
    node(int X=0,int Y=0){
        x=X,y=Y;
    }
}a[N],b[N],o;
node operator-(node p,node q){
    return node(p.x-q.x,p.y-q.y);
}
int F(node p,node q){
    return p.x*q.x+p.y*q.y;
}
int G(node p,node q){
    return p.x*q.y-p.y*q.x;
}
void cmin(int&x,int y){
    if(x>y)
        x=y;
}
int n,m,e[N][N];
int main()
{
    int i,j,k;
    while(cin>>n){
        for(i=1;i<=n;i=i+1)
            cin>>a[i].x>>a[i].y;
        cin>>m;
        for(i=1;i<=m;i=i+1)
            cin>>b[i].x>>b[i].y;
        for(i=1;i<=m;i=i+1)
            for(j=1;j<=m;j=j+1)
                e[i][j]=N;
        for(i=1;i<=m;i=i+1){
            for(j=1;j<=m;j=j+1){
                if(i==j)
                    continue;
                for(k=1;k<=n;k=k+1)
                    if(G(b[j]-b[i],a[k]-b[i])<0)
                        break;
                if(k>n)
                    e[i][j]=1;
            }
        }
        for(k=1;k<=m;k=k+1)
            for(i=1;i<=m;i=i+1)
                for(j=1;j<=m;j=j+1)
                    cmin(e[i][j],e[i][k]+e[k][j]);
        k=N;
        for(i=1;i<=m;i=i+1)
            cmin(k,e[i][i]);
        if(k>=N)
            cout<<"ToT"<<endl;
        else
            cout<<m-k<<endl;
    }
    return 0;
}