#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(false);
        cout << setprecision(15) << fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

constexpr int dx[7] = {0, 1, 1, 0, -1, -1, 0};
constexpr int dy[2][7] = {{1, 0, -1, -1, -1, 0, 0}, {1, 1, 0, -1, 0, 1, 0}};
signed main() {
    int sy, sx, gy, gx;
    cin >> sx >> sy >> gx >> gy;
    int n;
    cin >> n;
    vector<vector<bool>> fur(300, vector<bool>(300, false));
    REP(i, n) {
        int x, y;
        cin >> x >> y;
        fur[y + 150][x + 150] = true;
    }

    int ly, lx;
    cin >> lx >> ly;

    if (fur[150 + sy][150 + sx]) {
        cout << -1 << endl;
        return 0;
    }

    deque<tuple<int, int, int>> deq;
    deq.push_back(make_tuple(0, sy, sx));
    vector<vector<vector<int>>> dist(6, vector<vector<int>>(300, vector<int>(300, INF)));
    dist[0][150 + sy][150 + sx] = 0;

    while (!deq.empty()) {
        int t, y, x;
        tie(t, y, x) = deq.front(); deq.pop_front();
        int des = abs(x * y * t) % 6;
        REP(dir, 7) {
            int yy = y + dy[abs(x) % 2][dir];
            int xx = x + dx[dir];
            if (!INSEG(0, abs(yy), ly + 1) || !INSEG(0, abs(xx), lx + 1) || fur[yy + 150][xx + 150]) continue;
            int cost = (des != dir);
            if (chmin(dist[(t + 1) % 6][yy + 150][xx + 150], dist[t][y + 150][x + 150] + cost)) {
                auto nxt = make_tuple((t + 1) % 6, yy, xx);
                if (cost) {
                    deq.push_back(nxt);
                } else {
                    deq.push_front(nxt);
                }
            }
        }
    }
    int ans = INF;
    REP(i, 6) chmin(ans, dist[i][gy + 150][gx + 150]);
    if (ans != INF) {
        cout << ans << endl;
    } else {
        cout << -1 << endl;
    }
    return (0^_^0);
}




Measured memory_bytes: 7900