#include<bits/stdc++.h>
#define N 505
using namespace std;
const int maxn=1e9;
struct Point{
    int x,y;
    int operator * (const Point &b)const{
        return x*b.y-y*b.x;
    }
    Point operator - (const Point &b)const{
        return (Point){x-b.x,y-b.y};
    }
    int operator < (const Point &b)const{
        return x<b.x||x==b.x&&y<b.y;
    }
}a[N],b[N];
int n,m,dis[N][N];
int main(){
    while (scanf("%d",&n)!=EOF){
        for (int i=1;i<=n;i++)
            scanf("%d%d",&a[i].x,&a[i].y);
        scanf("%d",&m);
        for (int i=1;i<=m;i++)
            scanf("%d%d",&b[i].x,&b[i].y);
        for (int i=1;i<=m;i++)
            for (int j=1;j<=m;j++)
                dis[i][j]=maxn;
        for (int i=1;i<=m;i++)
            for (int j=i+1;j<=m;j++){
                int okij=1,okji=1;
                for (int k=1;k<=n&&(okij||okji);k++){
                    okij&=(a[k]-b[i])*(b[j]-b[i])<=0;
                    okji&=(a[k]-b[j])*(b[i]-b[j])<=0;
                }
                if (okij) dis[i][j]=1;
                if (okji) dis[j][i]=1;
            }
        int ans=maxn;
        for (int k = 1;k <= m;++k)
            for (int i = 1;i <= m;++i)
                if (dis[i][k] < maxn)
                    for (int j = 1;j <= m;++j)
                        dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);
        for (int i = 1;i <= m;++i) ans = min(dis[i][i],ans);
        if (ans==maxn) puts("ToT"); else printf("%d\n",m-ans);
    }
}