#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int MAXN = 300005;
int n, sx, sy;
pi s, e;
struct rect{ int sx, ex, sy, ey; }a[1005];
struct seg { int x, s, e, t; };
vector<seg> segs;
int dis[400500];
bool cross(seg a, seg b){
return a.t != b.t && b.s <= a.x && a.x <= b.e && a.s <= b.x && b.x <= a.e;
}
void shoot(int x, int y){
int minx = 0, maxx = sx-1;
int miny = 0, maxy = sy-1;
for(int i=0; i<n; i++){
if(a[i].sy < y && a[i].ey > y){
if(x <= a[i].sx) maxx = min(maxx, a[i].sx);
if(x >= a[i].ex) minx = max(minx, a[i].ex);
}
if(a[i].sx < x && a[i].ex > x){
if(y <= a[i].sy) maxy = min(maxy, a[i].sy);
if(y >= a[i].ey) miny = max(miny, a[i].ey);
}
}
if(minx < maxx){
segs.push_back({y, minx, maxx, 0});
}
if(miny < maxy){
segs.push_back({x, miny, maxy, 1});
}
}
int main(){
cin >> s.first >> s.second >> e.first >> e.second >> n;
vector<int> vx = {s.first, e.first}, vy = {s.second, e.second};
for(int i=0; i<n; i++){
scanf("%d %d %d %d",&a[i].sx,&a[i].ex,&a[i].sy,&a[i].ey);
vx.push_back(a[i].sx);
vx.push_back(a[i].ex);
vy.push_back(a[i].sy);
vy.push_back(a[i].ey);
}
sort(vx.begin(), vx.end());
vx.resize(unique(vx.begin(), vx.end()) - vx.begin());
sort(vy.begin(), vy.end());
vy.resize(unique(vy.begin(), vy.end()) - vy.begin());
auto getloc = [&](int x, vector<int> &v){
return lower_bound(v.begin(), v.end(), x) - v.begin();
};
s.first = getloc(s.first, vx);
s.second = getloc(s.second, vy);
e.first = getloc(e.first, vx);
e.second = getloc(e.second, vy);
for(int i=0; i<n; i++){
a[i].sx = getloc(a[i].sx, vx);
a[i].ex = getloc(a[i].ex, vx);
a[i].sy = getloc(a[i].sy, vy);
a[i].ey = getloc(a[i].ey, vy);
}
sx = vx.size();
sy = vy.size();
shoot(s.first, s.second);
shoot(e.first, e.second);
for(int i=0; i<n; i++){
shoot(a[i].sx, a[i].sy);
shoot(a[i].ex, a[i].ey);
}
shoot(0, 0);
shoot(sx-1, sy-1);
memset(dis, 0x3f, sizeof(dis));
queue<int> que;
for(int i=0; i<segs.size(); i++){
if(segs[i].t == 1 && segs[i].x == s.first && segs[i].s <= s.second && segs[i].e >= s.second){
dis[i] = 0;
que.push(i);
}
if(segs[i].t == 0 && segs[i].x == s.second && segs[i].s <= s.first && segs[i].e >= s.first){
dis[i] = 0;
que.push(i);
}
}
while(!que.empty()){
int x = que.front();
que.pop();
for(int i=0; i<segs.size(); i++){
if(dis[i] > dis[x] + 1 && cross(segs[x], segs[i])){
dis[i] = dis[x] + 1;
que.push(i);
}
}
}
int ret = 1e9;
for(int i=0; i<segs.size(); i++){
if(segs[i].t == 1 && segs[i].x == e.first && segs[i].s <= e.second && segs[i].e >= e.second){
ret = min(ret, dis[i]);
}
if(segs[i].t == 0 && segs[i].x == e.second && segs[i].s <= e.first && segs[i].e >= e.first){
ret = min(ret, dis[i]);
}
}
cout << ret + 1 << endl;
}
