#include <iostream>
#include <vector>
#include <map>
#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));
  }
}

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)

void gen_next(snake &base,snake &buf,
              int pos,int st,vector<snake> &dest)
{
  int n=buf.size();
  if (pos==n) dest.push_back(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;
    buf[pos]=p;
    gen_next(base,buf,pos+1,i==6?0:6,dest);
  _cont:;
  }
}

static map<snake,int> tbl;
static vector<snake> rev;

void regist(const snake &s)
{
  if (tbl.count(s)==0){
    tbl.insert(make_pair(s,tbl.size()));
    rev.push_back(s);
  }
}

vector<vector<pair<pt,int> > > next;

void all_gen(snake &s)
{
  int n=s.size();
  regist(snake(s.begin()+1,s.end()));
  if (n==8) return;
  for (int i=0;i<6;i++){
    pt p=s[n-1]+vect[i];
    for (int j=0;j<n;j++)   if (p==s[j]) goto _cont;
    for (int j=0;j<n-1;j++) if (adj(p,s[j])) goto _cont;
    s.push_back(p);
    all_gen(s);
    s.pop_back();
  _cont:;
  }
}

void init()
{
  snake s(1,pt(0,0));
  all_gen(s);
  for (int i=0;i<rev.size();i++){
    snake s(1,pt(0,0));
    s.insert(s.end(),rev[i].begin(),rev[i].end());
    vector<snake> tmp;
    snake buf(s.size());
    gen_next(s,buf,0,0,tmp);
    set<pair<pt,int> > ss;
    for (int j=0;j<tmp.size();j++){
      pt fst=tmp[j][0];
      snake ns(tmp[j].begin()+1,tmp[j].end());
      for (int k=0;k<ns.size();k++) ns[k]-=fst;
      ss.insert(make_pair(fst,tbl[ns]));
    }
    next.push_back(vector<pair<pt,int> >(ss.begin(),ss.end()));
  }
}


int main()
{
  init();
  for (int n;cin>>n,n!=0;){
    int sx,sy;cin>>sx>>sy;
    pt hd(sx,sy);
    snake sn;
    for (int i=0;i<n-1;i++){
      int x,y;cin>>x>>y;
      sn.push_back(pt(x,y)-hd);
    }
    int sid=tbl[sn];

    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);

    typedef pair<pt,int> spos;
    queue<pair<int,spos> > q;
    q.push(make_pair(0,spos(hd,sid)));
    set<spos> ss;
    for (;;){
      int depth=q.front().first;
      spos cur=q.front().second;
      q.pop();
      if (cur.first==g||depth==20){
        cout<<depth<<endl;
        break;
      }
      if (ss.count(cur)!=0) continue;
      ss.insert(cur);
      vector<spos> &nx=next[cur.second];
      for (int j=0;j<nx.size();j++){
        snake &nxs=rev[nx[j].second];
        pt nhd=cur.first+nx[j].first;
        if (st.count(nhd)!=0) goto _cont;
        for (int i=0;i<nxs.size();i++)
          if (st.count(nhd+nxs[i])!=0) goto _cont;
        q.push(make_pair(depth+1,spos(nhd,nx[j].second)));
      _cont:;
      }
    }
  }
  return 0;
}