#include <iostream> 
#include <algorithm> 
#include <cstring> 
#include <cstdio>
#include <vector> 
#include <queue> 
#include <cstdlib> 
#include <iomanip>
#include <cmath> 
#include <ctime> 
#include <map> 
#include <set> 
using namespace std; 
#define lowbit(x) (x&(-x)) 
#define max(x,y) (x>y?x:y) 
#define min(x,y) (x<y?x:y) 
#define MAX 100000000000000000 
#define MOD 1000000007
#define pi acos(-1.0) 
#define ei exp(1) 
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 1044266558
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
int n,m,vis[505][505];
int pos[505];
int dis[505];
int i,j,k,ans,flag;
struct Node
{
    int x;
    int 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;
    }
}h[505],s[505];
bool judge(Node x,Node y,Node z)
{
    if((x.x<z.x && y.x<z.x) ||(x.y<z.y && y.y<z.y) || (x.x>z.x && y.x>z.x) || (x.y>z.y && y.y>z.y)) return 1;
    return 0;
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(vis,62,sizeof(vis));
        for(i=1;i<=n;i++)
            scanf("%d%d",&h[i].x,&h[i].y);
        scanf("%d",&m);
        for(i=1;i<=m;i++)
            scanf("%d%d",&s[i].x,&s[i].y);
        for(i=1;i<=m;i++)
        {
            for(j=1;j<=m;j++)
            {
                flag=1;
                for(k=1;k<=n;k++)
                {
                    if((s[i]-s[j])*(s[i]-h[k])<0 || (s[i]-s[j])*(s[i]-h[k])==0 && judge(s[i],s[j],h[k]))
                    {
                        flag=0;
                        break;
                    }
                }
                if(flag) vis[i][j]=1;
            }
        }
        ans=INF;
        for(i=1;i<=m;i++)
        {
            for(j=1;j<=m;j++)
            {
                if(vis[j][i]==INF) continue;
                for(k=1;k<=m;k++)
                {
                    vis[j][k]=min(vis[j][k],vis[j][i]+vis[i][k]);
                }
            }
        }
        for(i=1;i<=m;i++)
            ans=min(ans,vis[i][i]);
        if(ans>m) printf("ToT\n");
        else printf("%d\n",m-ans);
    }
    return 0;
}