#include <bits/stdc++.h>


using namespace std;

const int N = 550;
const int INF = 0x3f3f3f3f;

struct node {
    int x,y;
    node operator - (const node &a) const {
        node c;
        c.x = x - a.x;
        c.y = y - a.y;
        return c;
    }
    double operator * (const node &a)const {
        return x*a.y - y*a.x;
    }
}a[N],s[N];

int w[N][N];

int judge(node a, node b, node c) {
    int xmax = max(a.x, b.x), xmin=min(a.x, b.x);
    int ymax = max(a.y, b.y), ymin=min(a.y, b.y);
    if(c.x >= xmin && c.x <= xmax && c.y >= ymin && c.y <= ymax) {
        return 0;
    }
    return 1;
}

int main() {
    int n,m;
    while(~scanf("%d",&n)) {
        memset(w,INF,sizeof(w));
        for(int i = 0;i<n;i++) {
            scanf("%d %d",&s[i].x, &s[i].y);
        }
        scanf("%d",&m);
        for(int i = 0;i<m;i++) {
            scanf("%d %d",&a[i].x, &a[i].y);
        }
        for(int i = 0;i<m;i++) {
            for(int j = 0;j<m;j++) {
                bool flag = false;
                for(int k = 0;k<n;k++) {
                    if((a[j]-a[i])*(s[k]-a[i]) < 0 ||((a[j]-a[i])*(s[k]-a[i])==0&&judge(a[i],a[j],s[k]))) {

                       // printf("%d %d\n",i,j);
                        flag = true;
                        break;
                    }
                }
                if(!flag) {
                    w[i][j] = 1;
                }
            }
        }
        for(int k = 0;k<m;k++) {
            for(int i = 0;i<m;i++) {
                if(w[i][k] == INF) continue;
                for(int j = 0 ;j<m;j++) {
                    w[i][j] = min(w[i][k] + w[k][j],w[i][j]);
                }
            }
        }
        int ans = INF;
        for(int i = 0;i<m;i++) {
            ans = min(ans, w[i][i]);
        }
        //printf("ans = %d\n",ans);
        if (ans > m) {
            printf("ToT\n");
        } else {
            printf("%d\n",m-ans);
        }
    }
    return 0;
}