#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 505;
const int inf = 0x3f3f3f3f;
struct Point{
    int x,y;
}A[N],B[N];
int n,m,mp[N][N];
int f(Point a,Point b,Point c){
    int x1 = a.x,y1 = a.y,x2 = b.x,y2 = b.y,x3 = c.x,y3 = c.y;
    return (x1 - x3) * (y2 - y3) - (y1 - y3) * (x2 - x3);
}
//在线段中间返回false，否则返回true 
bool check (Point a,Point b,Point c)//a是否不在b，c的中间 
{
    if (a.x>b.x&&a.x>c.x) return true;
    if (a.x<b.x&&a.x<c.x) return true;
    if (a.y>b.y&&a.y>c.y) return true;
    if (a.y<b.y&&a.y<c.y) return true;
    return false;
}
int main(){
    while(~scanf("%d",&n)){
        memset(mp,inf,sizeof(mp));
        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++){
                Point x = B[i],y = B[j];
                int cnt = 0;
                bool flag = 1;
                for(int k = 1;k <= n;k++){
                    int tmp = f(x,y,A[k]);
                    if(tmp < 0) flag = false;
                    if(tmp == 0 && check(A[k],x,y)) flag = false;
                    if(!flag) break;
                }
                if(flag) mp[i][j] = 1;
            }
        }
        for(int k = 1;k <= m;k++){
            for(int i = 1;i <= m;i++){
                if(mp[i][k] == inf) continue;
                for(int j = 1;j <= m;j++){
                    mp[i][j] = min(mp[i][j],mp[i][k] + mp[k][j]);
                }
            }
        }
        int ans = inf;
        for(int i = 1;i <= m;i++){
            ans = min(ans,mp[i][i]);
        }
        if(ans > m) puts("ToT");
        else printf("%d\n",m - ans);
    }
    return 0;
}