#include<bits/stdc++.h>

using namespace std;

const int M = 1e6 + ;

struct node{

    int u,v,w;

}e[M];

struct node1{

    int x,y;

}v[M];

int f[M],a[M];

bool cmp(node a,node b){

    return a.w < b.w;

}

int Find(int x){

    if(x == f[x]) return x;

    return f[x] = Find(f[x]);

}

int main()

{

    int n,m,cnt = ;

    cin>>n;

    for(int i = ;i <= n;i ++){

        cin>>a[i];

    }

    cin>>m;

    for(int i = ;i <= m;i ++){

        cin>>v[i].x>>v[i].y;

        f[i] = i;

    }

    for(int i = ;i <= m;i ++){

        for(int j = i+;j <= m;j ++){

            e[++cnt].u = i; e[cnt].v = j;

            e[cnt].w = (v[i].x-v[j].x)*(v[i].x-v[j].x)+(v[i].y-v[j].y)*(v[i].y-v[j].y);

        }

    }

    sort(e+,e++cnt,cmp);

    int mx = ,tot= ;

    for(int i = ;i <= cnt;i ++){

        int fx = Find(e[i].u),fy = Find(e[i].v);

        if(fx != fy){

            f[fy] = fx;

            tot++;

            if(tot == m-){

                mx = e[i].w;

                break;

            }

        }

    }

    //cout<<mx<<endl;

    int ans = ;

    for(int i = ;i <= n;i ++){

        if(a[i]*a[i] >= mx)

            ans++;

    }

    cout<<ans<<endl;

}