#include<cstdio>
#include<cstring>
const int N=505;
const int MAX=1<<28;
int n,m;
struct Node{int x,y;};
Node a[N],b[N];//住房   士兵
int f[N][N];
int mymin (int x,int y){return x<y?x:y;}
bool check (Node a,Node b,Node c)//a是否不在b，c的中间 
{
    if (a.x>b.x&&a.x>c.x) return true;
    if (a.x<b.x&&a.x<c.x) return true;
    if (a.y>b.y&&a.y>c.y) return true;
    if (a.y<b.y&&a.y<c.y) return true;
    return false;
}
double mu (Node a,Node b,Node c)
{
    double x1=a.x-c.x,y1=a.y-c.y;
    double x2=b.x-c.x,y2=b.y-c.y;
    return x1*y2-x2*y1;
}
int main()
{
    while (scanf("%d",&n)!=EOF)
    {
        for (int u=1;u<=n;u++) scanf("%d%d",&a[u].x,&a[u].y);
        scanf("%d",&m);
        for (int u=1;u<=m;u++) scanf("%d%d",&b[u].x,&b[u].y);
        for (int u=1;u<=m;u++)
            for (int i=1;i<=m;i++)
                f[u][i]=MAX;
        for (int u=1;u<=m;u++)
        {
            for (int i=1;i<=m;i++)
            {
                bool tf=true;
                for (int k=1;k<=n;k++)
                {
                    if (mu(a[k],b[i],b[u])<0)//左边
                         tf=false;
                    if (mu(a[k],b[i],b[u])==0&&check(a[k],b[i],b[u]))
                        tf=false;
                    if (!tf) break;
                }
                if (tf) f[u][i]=1;
            }
        }
        for (int u=1;u<=m;u++)
            for (int i=1;i<=m;i++)
            {
                if (f[i][u]==MAX) continue;
                for (int j=1;j<=m;j++)
                    f[i][j]=mymin(f[i][j],f[i][u]+f[u][j]);
            }
        int ans=MAX;
        for (int u=1;u<=m;u++)
            ans=mymin(ans,f[u][u]);
        if (ans>m) printf("ToT\n");
        else printf("%d\n",m-ans);
    }
    return 0;
}