#include<cstdio>
#include<algorithm>
using namespace std;
const int N=510,inf=10000000;
struct P{
  int x,y;
  P(){}
  P(int _x,int _y){x=_x,y=_y;}
  P operator+(const P&b){return P(x+b.x,y+b.y);}
  P operator-(const P&b){return P(x-b.x,y-b.y);}
  int operator*(const P&b){return x*b.x+y*b.y;}
}a[N],b[N],p[N],pp[N],hull[N],pivot;
int n,m,cnt,i,j,k,tmp,d[N][N],ans;
bool flag;
inline int cross(const P&A,const P&B){
  return A.x*B.y-A.y*B.x;
}
inline int cross(const P&A,const P&B,const P&C){
  return (B.x-A.x)*(C.y-A.y)-(B.y-A.y)*(C.x-A.x);
}
inline int distsqr(const P&A,const P&B){
  return (A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y);
}
inline bool cmp(const P&a,const P&b){
  int t=cross(pivot,a,b);
  return t>0||(t==0&&distsqr(pivot,a)<distsqr(pivot,b));
}
inline bool cmp2(const P&a,const P&b){
  return a.y!=b.y?a.y<b.y:a.x<b.x;
}
inline void convexHull(int n,P q[],int&m){
  int i,t;
  for(i=0;i<n;i++)pp[i]=p[i];
  sort(pp,pp+n,cmp2);
  int _=0;
  for(i=0;i<n;i++)if(!i||pp[i].x!=pp[i-1].x||pp[i].y!=pp[i-1].y)pp[_++]=pp[i];
  n=_;
  if(n<=2){
    for(i=0;i<n;i++)q[i]=pp[i];
    m=n;
    return;
  }
  pivot=pp[0];
  sort(pp+1,pp+n,cmp);
  q[0]=pp[0];q[1]=pp[1];
  for(t=1,i=2;i<n;i++){
    while(t&&cross(pp[i],q[t],q[t-1])>=0)--t;
    q[++t]=pp[i];
  }
  m=t+1;
}
inline bool point_on_segment(P p,P a,P b){
  return cross(b-a,p-a)==0&&(p-a)*(p-b)<=0;
}
inline bool inhull(const P&x){
  for(int i=0;i<cnt;i++)if(cross(hull[i],hull[i+1],x)<0)return 0;
  return 1;
}
inline bool check(const P&A,const P&B){
  if(flag){
    int i;
    for(i=0;i<m;i++)if(cross(A,B,b[i]))break;
    if(i==m)return 0;
  }
  for(int i=0;i<m;i++)if(cross(A,B,b[i])<0)return 0;
  return 1;
}
inline bool two(const P&A,const P&B){
  for(int i=0;i<m;i++)if(!point_on_segment(b[i],A,B))return 0;
  return 1;
}
inline bool all(const P&A){
  for(int i=0;i<m;i++)if(A.x!=b[i].x||A.y!=b[i].y)return 0;
  return 1;
}
int lim;
struct BIT{
  unsigned int a[N/32+1];
  BIT(){for(int i=0;i<=lim;i++)a[i]=0;}
  void clr(){for(int i=0;i<=lim;i++)a[i]=0;}
  void flip(int x){
    a[x>>5]^=1U<<(x&31);
  }
  int get(int x){return a[x>>5]>>(x&31)&1;}
}g[N],vis;
int h,t,z,q[N],f[N];
inline void add(int x){
  vis.flip(x);
  q[++t]=x;
  f[x]=z;
}
inline void bfs(int S){
  int i,x;
  unsigned int y;
  vis.clr();
  h=1,t=0;
  for(i=0;i<n;i++)if(g[S].get(i)){
    f[i]=1;
    q[++t]=i;
  }else{
    vis.flip(i);
  }
  while(h<=t){
    x=q[h++];
    if(x==S){
      if(f[x]<ans)ans=f[x];
      //if(f[x]==2)printf("%d %d\n",a[S].x,a[S].y);
      return;
    }
    z=f[x]+1;
    for(i=0;i<=lim;i++)for(y=vis.a[i]&g[x].a[i];y;y-=y&-y){
      add(i<<5|__builtin_ctz(y));
    }
  }
}
bool same_line(const P&A,const P&B){
  for(int i=0;i<m;i++)if(cross(A,B,b[i])!=0)return 0;
  return 1;
}
void solve(){
  for(i=0;i<m;i++)scanf("%d%d",&b[i].x,&b[i].y),p[i]=b[i];
  convexHull(m,hull,cnt);
  m=cnt;
  for(i=0;i<m;i++)b[i]=hull[i];
  scanf("%d",&n);
  int NNN=n;
  for(i=0;i<n;i++)scanf("%d%d",&a[i].x,&a[i].y);
  sort(a,a+n,cmp2);
  int _=0;
  for(i=0;i<n;i++)if(!i||a[i].x!=a[i-1].x||a[i].y!=a[i-1].y)a[_++]=a[i];
  n=_;
  for(i=0;i<n;i++)p[i]=a[i];
  convexHull(n,hull,cnt);
  hull[cnt]=hull[0];
  for(i=0;i<n;i++)if(all(a[i])){
    printf("%d\n",NNN-1);
    return;
  }
  for(i=0;i<n;i++)for(j=0;j<i;j++){
    if(two(a[i],a[j])){
      printf("%d\n",NNN-2);
      return;
    }
  }
  if(n<=2){
    puts("ToT");
    return;
  }
  flag=0;
  if(m>1){
    if(same_line(b[0],b[1])){
      flag=1;
    }
  }
  for(i=0;i<m;i++)if(!inhull(b[i])){
    puts("ToT");
    return;
  }
  lim=(n-1)/32;
  for(i=0;i<n;i++){
    g[i].clr();
    for(j=0;j<n;j++){
      d[i][j]=inf;
      if(i!=j&&check(a[i],a[j]))d[i][j]=1,g[i].flip(j);
    }
  }
  //for(k=0;k<n;k++)for(i=0;i<n;i++)for(j=0;j<n;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
  ans=inf;
  for(i=0;i<n;i++)bfs(i);
  //for(i=0;i<n;i++)ans=min(ans,d[i][i]);
  if(ans<10000)printf("%d\n",NNN-ans);else puts("ToT");
}
int main(){
  while(~scanf("%d",&m))solve();
}