#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <complex>
using namespace std;

typedef complex<int> pt;
typedef vector<pt> snake;

namespace std{
  inline bool operator<(const pt &a,const pt &b){
    return make_pair(real(a),imag(a))<make_pair(real(b),imag(b));
  }
}

void gen(snake &base,snake &buf,
         int pos,int st,set<pt> &stone,
         int depth,queue<pair<int,snake> > &dest)
{
  static const pt vect[6+1]={
    pt(0,-1),pt(1,-1),pt(1,0),pt(0,1),pt(-1,1),pt(-1,0),pt(0,0)};
  #define adj(a,b) (find(vect,vect+6,a-b)-vect<6)

  int n=buf.size();
  if (pos==n) dest.push(make_pair(depth,buf));
  else for (int i=st;i<7;i++){
    pt p=base[pos]+vect[i];
    for (int j=0;j<pos;j++)   if (buf[j]==p) goto _cont;
    for (int j=0;j<pos-1;j++) if (adj(buf[j],p)) goto _cont;
    if (pos!=n-1&&!adj(base[pos+1],p)) goto _cont;
    if (pos!=0  &&!adj(base[pos-1],p)) goto _cont;
    if (stone.count(p)!=0) goto _cont;
    buf[pos]=p;
    gen(base,buf,pos+1,i==6?0:6,stone,depth,dest);
  _cont:;
  }
}

int main()
{
  for (int n;cin>>n,n!=0;){
    snake sn(n);
    for (int i=0;i<n;i++){
      int x,y;cin>>x>>y;
      sn[i]=pt(x,y);
    }
    int k;cin>>k;
    set<pt> st;
    for (int i=0;i<k;i++){
      int x,y;cin>>x>>y;
      st.insert(pt(x,y));
    }
    int gx,gy;cin>>gx>>gy;
    pt g(gx,gy);

    queue<pair<int,snake> > q;
    q.push(make_pair(0,sn));
    set<snake> ss;
    for (;;){
      int depth=q.front().first;
      snake cur=q.front().second;
      q.pop();
      if (cur[0]==g||depth==20){
        cout<<depth<<endl;
        break;
      }
      if (ss.count(cur)!=0) continue;
      ss.insert(cur);
      snake buf(n);
      gen(cur,buf,0,0,st,depth+1,q);
    }
  }
  return 0;
}