#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const long double pi=3.1415926535897932384626433832795;
const long double eps=1e-9;
const int INF=(1<<30)-1;
const int N=510;
const int M=N*N;
int n,m,e;
int lnk[N],nex[M],nd[M],qu[N],vis[N],unable[N];
struct point{
    int x,y;
    point (int x=0,int y=0):x(x),y(y){}
    point operator -(point b){
        return point(x-b.x,y-b.y);
    }
    int operator *(point b){
        return x*b.y-y*b.x;
    }
}p[N],q[N];
struct query{
    int id,ty; long double d;
    bool operator <(const query &b)const{return d<b.d;}
}que[N+N];
long double get(int L,int R){
    if (R>=L) return que[R].d-que[L].d;
    else return que[R].d+pi*2-que[L].d;
}
bool gin(long double x,long double L,long double R){
    if (R+eps>=L)  return (x+eps>=L) && (x<=R+eps);
    else return (x+eps>=L) || (x<=R+eps);
}
void add(int u,int v){
    nd[++e]=v; nex[e]=lnk[u]; lnk[u]=e;
    //printf("Ad %d %d\n",u,v);
}
int main(){
    //freopen("hehe.in","r",stdin);
    //freopen("h0.out","w",stdout);
    //freopen("data.in","r",stdin);
    while (scanf("%d",&n)!=EOF){
        e=0;
        memset(lnk,0,sizeof(lnk));
        memset(unable,0,sizeof(unable));
        for (int i=1; i<=n; i++) scanf("%d%d",&p[i].x,&p[i].y);
        scanf("%d",&m);
        for (int i=1; i<=m; i++) scanf("%d%d",&q[i].x,&q[i].y);
        /*if (n==1){
            bool can=0;
            for (int i=1; i<=m; i++) if(q[i].x==p[1].x && q[i].y==p[1].y) can=1;
            if (can) printf("%d\n",m-1);
            else puts("ToT");
            continue;
        }*/
        for (int i=1; i<m; i++)
            for (int j=i+1; j<=m; j++)
                if (q[i].x==q[j].x && q[i].y==q[j].y){
                    unable[i]=1;
                    break;
                }
        for (int  i=1; i<=m; i++) if (!unable[i]) {
            int t=0;
            for (int j=1; j<=m; j++) if (j!=i) que[t].id=j,que[t].d=atan2(q[j].x-q[i].x,q[j].y-q[i].y),que[t++].ty=0;
            for (int j=1; j<=n; j++) if (p[j].x!=q[i].x || p[j].y!=q[i].y) que[t].d=atan2(p[j].x-q[i].x,p[j].y-q[i].y),que[t++].ty=1;
            sort(que,que+t);
            int L=-1,R;
            for (int j=0; j<t; j++) if (que[j].ty) {L=j; break;}
            for (int j=t-1; j>=0; j--) if (que[j].ty) {R=j; break;}
            if (L==-1){add(i,i);continue;}
            if (get(L,R)>pi+eps){
                int finish=R;
                for (int j=L+1; j<=finish; j++) if (que[j].ty){
                    R=L; L=j;  if (get(L,R)<=pi+eps) break;
                }
            }
            if (get(L,R)>pi+eps) continue;
            //printf("%d %d %d\n",i,L,R);
            //for (int j=0; j<t; j++) printf("= %d %.5f\n",que[j].ty,que[j].d);
            long double zl=que[L].d+pi,zr=que[R].d+pi;
            if (zl>pi+eps) zl-=2*pi;
            if (zr>pi+eps) zr-=2*pi;
            for (int j=0; j<t; j++) if (!que[j].ty){
                if (gin(que[j].d,zr,que[L].d)) add(i,que[j].id);
            }
        }
        int Ans=INF;
        for (int i=1; i<=m; i++) if (!unable[i]) {
            int h=0,t=1,ans=INF; qu[0]=i; memset(vis,-1,sizeof(vis));
            vis[i]=0;
            while (h<t){
                int v=qu[h++];
                for (int j=lnk[v]; j; j=nex[j])
                    if (vis[nd[j]]==-1)
                        vis[nd[j]]=vis[v]+1,qu[t++]=nd[j];
                    else if (nd[j]==i) ans=vis[v]+1;
                if (ans<INF) break;
            }
            if (ans<Ans) Ans=ans;
        }
        Ans==INF?puts("ToT"):printf("%d\n",m-Ans);
    }
    return 0;
}