#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define rep(i,l,r) for (int i=(l); i<=(r); i++)

 using namespace std;

 const int N=,M=;

 int n,m,tot,ans,mx,k,a[N],fa[N];

 struct P{ int x,y; }p[N];

 struct E{ int u,v,w; }e[M];

 bool operator <(const E &a,const E &b){ return a.w<b.w; }

 int sqr(int x){ return x*x; }

 int get(int x){ return (fa[x]==x) ? x : fa[x]=get(fa[x]); }

 int main(){

     scanf("%d",&m);

     rep(i,,m) scanf("%d",&a[i]);

     scanf("%d",&n);

     rep(i,,n) scanf("%d%d",&p[i].x,&p[i].y),fa[i]=i;

     rep(i,,n-) rep(j,i+,n) e[++tot]=(E){i,j,sqr(p[i].x-p[j].x)+sqr(p[i].y-p[j].y)};

     sort(e+,e+tot+);

     rep(i,,tot){

         int u=e[i].u,v=e[i].v;

         if (get(u)==get(v)) continue;

         k++; mx=max(mx,e[i].w);

         if (k==n-) break;

         fa[get(u)]=get(v);

     }

     rep(i,,m) if (sqr(a[i])>=mx) ans++;

     printf("%d\n",ans);

     return ;

 }