#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
const int N = 550;
struct Point {
    int x, y;
};
int n, m, G[N][N];
Point a[N], b[N];
int mymin (int x,int y){return x<y?x:y;}
bool check(Point a, Point b, Point 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;
}
double fun(Point a, Point b, Point c) {
    double x1 = a.x - c.x, y1 = a.y - c.y;
    double x2 = b.x - c.x, y2 = b.y - c.y;
    return x1 * y2 - x2 * y1;
}
int main() {
    while(scanf("%d", &n) != EOF) {
        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 ++) {
                G[i][j] = INF;
            }
        }
        for(int i = 1; i <= m; i ++) {
            for(int j = 1; j <= m; j ++) {
                bool flag = true;
                for(int k = 1; k <= n; k ++) {
                    if(fun(a[k], b[j], b[i]) < 0) flag = false;
                    if(fun(a[k], b[j], b[i]) == 0 && check(a[k], b[j], b[i])) flag = false;
                    if(!flag) break;
                }
                if(flag) G[i][j] = 1;
            }
        }
        for(int i = 1; i <= m; i ++) {
            for(int j = 1; j <= m; j ++) {
                if(G[j][i] == INF) continue;
                for(int k = 1; k <= m; k ++) {
                    G[j][k] = mymin(G[j][k], G[j][i] + G[i][k]);
                }
            }
        }
        int ans = INF;
        for(int i = 1; i <= m; i ++) {
            ans = mymin(ans, G[i][i]);
        }
        if(ans > m) printf("ToT\n");
        else printf("%d\n",m - ans);
    }
    return 0;
}