#include <bits/stdc++.h>
#define Maxn 507
using namespace std;
int read()
{
    int x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m;
int que[Maxn*507];
bool vis[Maxn];
int dis[Maxn][Maxn];
int f[Maxn];
struct point
{
    int x,y;
};
point p[Maxn];
point a[Maxn];
point operator -(point a,point b)
{
    return (point){a.x-b.x,a.y-b.y};
}
long long operator *(point a,point b)
{
    return (a.x*b.y)-(a.y*b.x);
}
long long operator ^(point a,point b)
{
    return a.x*b.x+a.y*b.y;
}
bool operator ==(point a,point b)
{
    return a.x==b.x&&a.y==b.y;
}
bool operator < (point a,point b)
{
    return a.x==b.x ? a.y<b.y : a.x<b.x;
}
bool inn(point x,point y,point z)
{
    if(!((x.x<=y.x&&y.x<=z.x)||(z.x<=y.x&&y.x<=x.x)))return 0;
    if(!((x.y<=y.y&&y.y<=z.y)||(z.y<=y.y&&y.y<=x.y)))return 0;
    return 1;
}
bool check(int A,int B)
{
    for (int i=1;i<=m;i++)
    {
        long long cal=(a[B]-a[A])*(p[i]-a[A]);
        if (cal<0) return false;
        else if (cal==0&&!inn(a[B],p[i],a[A])) return false;
    }    
    return true;
}
int main()
{
    while (scanf("%d",&m)==1)
    {
        for (int i=1;i<=m;i++)
            p[i].x=read(),p[i].y=read();
        random_shuffle(p+1,p+m+1);
        n=read();
        for (int i=1;i<=n;i++)
          a[i].x=read(),a[i].y=read();
        random_shuffle(a+1,a+n+1);
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
            {
                dis[i][j]=20007;
                if (i!=j&&check(i,j)) dis[i][j]=1;
            }
        bool check=false;
        for (int i=1;i<=m;i++)
            for (int j=1;j<=n;j++)
                if (p[i].x==a[j].x&&p[i].y==a[j].y) check=true;
        int ans=n+1;
        for (int k=1;k<=n;k++)
            for (int i=1;i<=n;i++)
                if (dis[i][k]<20007)
                    for (int j=1;j<=n;j++)
                        dis[i][j]=min(dis[i][k]+dis[k][j],dis[i][j]);
        for (int i=1;i<=n;i++)
            ans=min(dis[i][i],ans);
        if (ans>n) printf("ToT\n"); else printf("%d\n",n-ans);
    }
    return 0;
}