#include<iostream>
using namespace std;
#define maxn 500
#define inf 10000001
int g[maxn][maxn],dist[maxn][maxn];
int n,m;
struct node
{
    int x;
    int y;
}houses[maxn],defenders[maxn];
void clearset(int n)
{
    for(int i = 0;i < n;i++)
        for(int j = 0;j < n;j++)
        {
            g[i][j] = inf;
            dist[i][j] = inf;
        }
}
int floyd(int n)
{
        int minn = inf;
        for(int k = 0;k < n;k++)
        {
            for(int i = 0;i < k;i++)
                {
                    if (g[i][k] == inf) continue;
                    for(int j = 0;j < k;j++)
                    {
                        minn=min(minn,g[i][k] + g[k][j] + dist[j][i]);
                    }
                }
            for(int i = 0;i < n;i++)
                {
                    if (dist[i][k] == inf) continue;
                    for(int j=0;j<n;j++)
                    {
                        dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
                    }
                }
        }
        return minn;
}
int cross(node a,node b,node p)
{
    return (p.x-a.x)*(b.y-a.y)-(b.x-a.x)*(p.y-a.y);
}
bool judge(node a, node b)
{
    node temp;
    for(int i = 0;i < n;i++)
    {
        if(cross(a,b,houses[i]) < 0)
            return false;
        if(cross(a,b,houses[i]) == 0)
        {
            temp = houses[i];
            if((temp.x > a.x && temp.x > b.x) || (temp.x < a.x && temp.x < b.x))
            return false;
        }
    }
    return true;
}
int main()
{
    while(scanf("%d",&n) != EOF)
    {
        int x,y;
        for(int i = 0;i < n;i++) scanf("%d%d",&houses[i].x,&houses[i].y);
        scanf("%d",&m);
        for(int i = 0;i < m;i++) scanf("%d%d",&defenders[i].x,&defenders[i].y);
        clearset(m);
        for(int i = 0;i < m;i++)
            for(int j = 0;j < m;j++)
            {
                if (judge(defenders[i],defenders[j])) g[i][j] = dist[i][j]=1;
            }
        int r = m-floyd(m);;
        if (r >= 0)
        cout<<r<<endl;
        else
        cout<<"ToT"<<endl;
    }
    return 0;
}