#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }

template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) cout << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }

template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
bool in_seg(int n, int l, int r) { return l <= n && n < r; } // n in [l, r)?

typedef long long ll;
typedef pair<int, int> pint;

// y(v): v>^<  y(^): ^>v<
// const int dx[] = { 0, 1, 0, -1 };
// const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);
#define mp make_pair



const int dx[] = { 0, 1, 1, 0, -1, -1 };
const int dy[] = { 1, 0, -1, -1, 0, 1 };
bool neibor(int x1, int y1, int x2, int y2)
{
    int x = x1 - x2, y = y1 - y2;
    rep(i, 6)
        if (dx[i] == x && dy[i] == y)
            return true;
    return false;
}
int n;
set<pint> rock;
struct Hebi
{
    int x[8], y[8];
    bool operator<(const Hebi& o) const
    {
        rep(i, n)
            if (x[i] != o.x[i])
                return x[i] < o.x[i];
        rep(i, n)
            if (y[i] != o.y[i])
                return y[i] < o.y[i];
        return false;
    }

    void next(vector<Hebi>& res)
    {
        vector<int> dir[8];
        rep(i, n) rep(j, 6)
        {
            int nx = x[i] + dx[j], ny = y[i] + dy[j];
            if ((i == n - 1 || neibor(nx, ny, x[i + 1], y[i + 1])) && 
                (i == 0 || neibor(nx, ny, x[i - 1], y[i - 1])) && 
                !rock.count(pint(nx, ny)))
                dir[i].pb(j);
        }
        dfs(0, true, dir, res);
    }
private:
    bool check(int dep)
    {
        rep(j, dep - 1)
            if ((x[dep] == x[j] && y[dep] == y[j]) || 
                neibor(x[dep], y[dep], x[j], y[j]))
                return false;
        return true;
    }
    void dfs(int dep, bool can_move, vector<int>* dir, vector<Hebi>& res)
    {
        if (dep == n)
        {
            res.pb(*this);

            return;
        }

        if (check(dep))
            dfs(dep + 1, true, dir, res);

        if (can_move)
        {
            rep(i, dir[dep].size())
            {
                int d = dir[dep][i];
                x[dep] += dx[d], y[dep] += dy[d];

                if (check(dep))
                    dfs(dep + 1, false, dir, res);

                x[dep] -= dx[d], y[dep] -= dy[d];
            }
        }
    }
};
int main()
{
    while (cin >> n, n)
    {
        Hebi init;
        rep(i, n)
            cin >> init.x[i] >> init.y[i];

        rock.clear();
        int k;
        cin >> k;
        while (k--)
        {
            int x, y;
            cin >> x >> y;
            rock.insert(pint(x, y));
        }

        int gx, gy;
        cin >> gx >> gy;
        if (init.x[0] == gx && init.y[0] == gy)
        {
            cout << 0 << endl;
            continue;
        }

        int res = -1;
        queue<Hebi> q;
        map<Hebi, int> dist;
        q.push(init);
        dist[init] = 0;
        while (!q.empty())
        {
            Hebi cur = q.front();
            q.pop();

            int nd = dist[cur] + 1;

            vector<Hebi> next;
            cur.next(next);

            rep(i, next.size())
            {
                if (!dist.count(next[i]))
                {
                    if (next[i].x[0] == gx && next[i].y[0] == gy)
                    {
                        res = nd;
                        goto End;
                    }
                    q.push(next[i]);
                    dist[next[i]] = nd;
                }
            }
        }
    End:
        assert(res != -1);
        assert(res <= 20);
        
        cout << res << endl;
    }
}

Measured memory_bytes: 22256