#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
              //       #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,pa>
                            #define ppa pair<pa,pa>
                            #define ppap pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                  
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                             double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
bool parareru(Point a,Point b,Point c,Point d){
//	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
	return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
  return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
//		cout<<"sss"<<endl;
		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
		return false;
	}
  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}

double segment_dis(Segment a,Segment b){
	if(is_intersected_ls(a,b))return 0;
	double r=distance_ls_p(a.p1, a.p2, b.p1);
	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
	return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2-b.p1;
  double d1 = abs(cross(ba, a.p1-b.p1));
  double d2 = abs(cross(ba, a.p2-b.p1));
  double t = d1 / (d1 + d2);

  return a.p1 + (a.p2-a.p1) * t;
}

                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
 
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }
                /*}
int pr[100010];
//int inv[100010];
 
int beki(int wa,int rr){
	if(rr==0) return 1ll;
	if(rr==1) return wa;
	if(rr%2==1) return (beki(wa,rr-1)*wa)%inf;
	int zx=beki(wa,rr/2);
	return (zx*zx)%inf;
}
  
void gya(){
	pr[0]=1;
	for(int i=1;i<100010;i++){
		pr[i]=(pr[i-1]*i)%inf;
	}
	for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
	
}

*/

                         //----------------kokomade tenpure------------

int dx[7]={0,1,1,0,-1,-1,0},dy[7]={1,0,-1,-1,-1,0,0};
int dx2[7]={0,1,1,0,-1,-1,0},dy2[7]={1,1,0,-1,0,1,0};
int z[210][210]={0};
int kyo[210][210][6];
vector<ppa> G[210][210][6];
int sx,sy,gy,gx,lx,ly,n;

priority_queue<ppa,vector<ppa>,greater<ppa> > pq;


signed main(){

	int cnt=0;
	
//		int n;

		cin>>sx>>sy>>gx>>gy;
		
		cin>>n;
	for(int i=0;i<n;i++){
		int rt,rtt;
		cin>>rt>>rtt;
		z[rt+100][rtt+100]=1;
	}
	cin>>lx>>ly;
	for(int i=0;i<210;i++)for(int j=0;j<210;j++)for(int t=0;t<6;t++)kyo[i][j][t]=-1;
	for(int t=0;t<6;t++)for(int i=100-lx;i<=100+lx;i++)for(int j=100-ly;j<=100+ly;j++){
		int sd=abs((i-100)*(j-100)*t)%6;
		if(i%2==0){
			for(int k=0;k<7;k++){
				if(i+dx[k]<100-lx ||i+dx[k]>100+lx || j+dy[k]<100-ly || j+dy[k]>100+ly) continue;
				if(z[i+dx[k]][j+dy[k]]==1) continue;
				if(k!=sd)G[i][j][t].pb(mp(mp(1,(t+1)%6),mp(i+dx[k],j+dy[k])));
				else G[i][j][t].pb(mp(mp(0,(t+1)%6),mp(i+dx[k],j+dy[k])));
			}
		}
		else{
			for(int k=0;k<7;k++){
				if(z[i+dx2[k]][j+dy2[k]]==1) continue;
				if(i+dx2[k]<100-lx ||i+dx2[k]>100+lx || j+dy2[k]<100-ly || j+dy2[k]>100+ly) continue;
				if(k!=sd)G[i][j][t].pb(mp(mp(1,(t+1)%6),mp(i+dx2[k],j+dy2[k])));
				else G[i][j][t].pb(mp(mp(0,(t+1)%6),mp(i+dx2[k],j+dy2[k])));
			}
		}		
	}
	
	pq.push(mp(mp(0,0),mp(sx+100,sy+100)));
	
	while(pq.size()>0){
		ppa z=pq.top();
		pq.pop();
	
		if(kyo[z.second.first][z.second.second][z.first.second]>=0) continue;
		kyo[z.second.first][z.second.second][z.first.second]=z.first.first;
		//	cout<<z.second.first<<" "<<z.second.second<<endl;
		if(z.second.first==100+gx&&z.second.second==100+gy){
			cout<<z.first.first<<endl;
			return 0;
		}
		for(int i=0;i<G[z.second.first][z.second.second][z.first.second].size();i++){
			ppa zz=G[z.second.first][z.second.second][z.first.second][i];
			if(kyo[zz.second.first][zz.second.second][(zz.first.second)%6]>=0) continue;
			pq.push(mp(mp(z.first.first+zz.first.first,zz.first.second),mp(zz.second.first,zz.second.second)));
		}
		
	}
	cout<<-1<<endl;
	
	return 0;
}

Measured memory_bytes: 44308