#include<bits/stdc++.h>
using namespace std;
const int maxn=505;
const int maxm=505;
const double eps=1e-8;
const double inf=1e20;
const int INF=0x3f3f3f3f;
const double pi=acos(-1.0);
const int maxp=1010;
 
int sgn(double x){
    if(fabs(x)<eps) return 0;
    if(x<0) return -1;
    else return 1;
}
 
struct Point{
    double x,y;
    Point(){}
    Point(double _x,double _y){
        x=_x;
        y=_y;
    }
    bool operator == (Point b) const{
        return sgn(x-b.x)==0&&sgn(y-b.y)==0;
    }
    bool operator < (Point b) const{
        return sgn(x-b.x)==0?sgn(y-b.y)<0:x<b.x;
    }
    Point operator -(const Point &b) const{
        return Point(x-b.x,y-b.y);
    }
    double operator ^(const Point &b) const{
        return x*b.y-y*b.x;
    }
    double operator *(const Point &b) const{
        return x*b.x+y*b.y;
    }
};
 
int judge(Point s,Point e,Point p){
    if(  (s.x<p.x&&e.x<p.x)||(s.y>p.y&&e.y>p.y)||(s.x>p.x&&e.x>p.x)||(s.y<p.y&&e.y<p.y)  ) return 1;
    return 0;
}
 
struct line{
    Point s,e;
    line(){};
    line(Point _s,Point _e){
        s=_s;
        e=_e;
    }
    int pointonseg(Point p){
        if( sgn( (s-e)^(s-p) )==0 &&judge(s,e,p)) return 1;
        if( sgn( (s-e)^(s-p) )<0 ) return 1;
        else return -1;
    }
};
 
int n,m;
Point a[maxn],b[maxm];
int G[maxm][maxm];
 
void init(){
    memset(G,INF,sizeof(G));
}
 
int main()
{
    while(~scanf("%d",&n)){
        init();
        for(int i=1;i<=n;++i){
            scanf("%lf%lf",&a[i].x,&a[i].y);
        }
        scanf("%d",&m);
        for(int i=1;i<=m;++i){
            scanf("%lf%lf",&b[i].x,&b[i].y);
        }
        for(int i=1;i<=m;++i){
            for(int j=1;j<=m;++j){
                line Line;
                Line.s=b[i],Line.e=b[j];
                int flag=1;
                for(int k=1;k<=n;++k){
                    if(Line.pointonseg(a[k])==1){
                        flag=0;
                        break;
                    }
                }
                if(flag){
                    G[i][j]=1;
                }
            }
        }
        int num_puts=INF;
        for(int k=1;k<=m;++k){
            for(int i=1;i<=m;++i){
                if(G[i][k]==INF) continue;
                for(int j=1;j<=m;++j){
                    G[i][j]=min(G[i][j],G[i][k]+G[k][j]);
                }
 
            }
        }
        for(int i=1;i<=m;++i){
            num_puts=min(num_puts,G[i][i]);
        }
        if(num_puts==INF) cout<<"ToT\n";
        else cout<<m-num_puts<<endl;
 
    }
    return 0;
}