#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,ans,x[509],y[509],p[509],q[509],f[509][509];
inline ll read(){
    ll s = 0,w = 1;
    char ch = getchar();
    while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
    while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
    return s * w;
}
bool judge(ll a,ll b,ll c){
    if (p[a] < x[c] && p[b] < x[c]) return 1;
    if (p[a] > x[c] && p[b] > x[c]) return 1;
    if (q[a] < y[c] && q[b] < y[c]) return 1;
    if (q[a] > y[c] && q[b] > y[c]) return 1;
    return 0;
}
int main(){
    while (cin>>n){
        for (ll i = 1;i <= n;i += 1) x[i] = read(),y[i] = read();
        m = read();
        for (ll i = 1;i <= m;i += 1) p[i] = read(),q[i] = read();
        for (ll i = 1;i <= m;i += 1) for (ll j = 1;j <= m;j += 1) f[i][j] = 1e18;
        for (ll i = 1;i <= m;i += 1) for (ll j = 1;j <= m;j += 1){
            bool fl = 1;
            for (ll k = 1;k <= n;k += 1){
                ll a = p[j] - p[i],b = q[j] - q[i],c = x[k] - p[i],d = y[k] - q[i],prod = a * d - b * c;
                if (prod < 0 || !prod && judge(i,j,k)){fl = 0; break;}
            }
            if (fl) f[i][j] = 1;
        }
        ans = 1e18;
        for (ll i = 1;i <= m;i += 1) for (ll j = 1;j <= m;j += 1) for (ll k = 1;k <= m;k += 1) f[j][k] = min(f[j][k],f[j][i] + f[i][k]);
        for (ll i = 1;i <= m;i += 1) ans = min(ans,f[i][i]);
        if (ans == 1e18) puts("ToT");
        else printf("%lld\n",m - ans);
    }
    return 0;
}