#include <bits/stdc++.h>
using namespace std;
const int inf=0x3f3f3f3f;
int n,m,x1[505],y1[505],x2[505],y2[505],d[505];
vector<int> G[505];
inline side(int x,int y,int x1,int y1,int x2,int y2) {
    int X1=x2-x1,Y1=y2-y1;
    int X2=x1-x,Y2=y1-y;
    return X1*Y2-X2*Y1<0;
}
inline bool check(int ii,int jj) {
    if (x2[ii]==x2[jj]&&y2[ii]==y2[jj])
        return false;
    for (int i=0;i<n;++i)
        if (side(x1[i],y1[i],x2[ii],y2[ii],x2[jj],y2[jj])>0)
            return false;
    return true;
}
inline bfs(int o) {
    queue<int> que;
    que.push(o);
    memset(d,0x3f,sizeof d);
    d[o]=0;
    while (!que.empty()) {
        int u=que.front();
        que.pop();
        for (int i=0;i<(int)G[u].size();++i) {
            int v=G[u][i];
            if (v==o)
                return d[u]+1;
            if (d[v]!=inf)
                continue;
            d[v]=d[u]+1;
            que.push(v);
        }
    }
    return inf;
}
int main()
{
    while (scanf("%d",&n)==1) {
        for (int i=0;i<n;++i)
            scanf("%d%d",&x1[i],&y1[i]);
        scanf("%d",&m);
        for (int i=0;i<m;++i)
            scanf("%d%d",&x2[i],&y2[i]);
        for (int i=0;i<m;++i) {
            G[i].clear();
            for (int j=0;j<m;++j)
                if (i!=j&&check(i,j))
                    G[i].push_back(j);
        }
        int res=inf;
        for (int i=0;i<m;++i)
            res=min(res,bfs(i));
        if (res==inf)
            puts("ToT");
        else
            printf("%d\n",m-res);
    }
    return 0;
}