#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 2010;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modInt {
T val;
T mod = 0;
// static const T mod = MOD;
void normalize() {
if (mod == 0) return;
val %= mod; if (val < 0) val += mod;
}
modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
// modInt(T v = 0, T m = 0) : val(v) { normalize(); }
explicit operator T() const { return val; }
friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }
friend void check(modInt& a, modInt& b) { // make sure all operations are valid
// comment out if mod is static const
if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
if (a.mod != mod) { a.mod = mod; a.normalize(); }
if (b.mod != mod) { b.mod = mod; b.normalize(); }
}
friend modInt operator+(modInt a, modInt b) {
check(a,b); a.val += (T)b;
if (a.val >= a.mod) a.val -= a.mod;
return a;
}
friend modInt operator-(modInt a, modInt b) {
check(a,b); a.val -= (T)b;
if (a.val < 0) a.val += a.mod;
return a;
}
friend modInt operator-(const modInt& a) { return modInt(0)-a; }
friend modInt operator*(modInt a, modInt b) {
check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
}
friend modInt exp(modInt a, ll p) {
modInt ans(1,a.mod);
for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modInt inv(const modInt& a) {
return {invGeneral(a.val,a.mod),a.mod};
// return exp(b,b.mod-2) if prime
}
friend modInt operator/(modInt a, modInt b) {
check(a,b); return a*inv(b);
}
};
typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int N;
pi S,E;
vector<pair<pi,pi>> v;
vi x, y;
int dist[MX][MX][5], badV[MX][MX], badH[MX][MX];
int xd[4] = {0,1,0,-1}, yd[4] = {1,0,-1,0};
void getInd(vi& a, int& b) {
b = lb(all(a),b)-a.begin()+1;
}
void compressX() {
sort(all(x)); x.erase(unique(all(x)),x.end());
getInd(x,S.f);
getInd(x,E.f);
trav(t,v) {
getInd(x,t.f.f);
getInd(x,t.f.s);
}
}
void compressY() {
sort(all(y)); y.erase(unique(all(y)),y.end());
getInd(y,S.s);
getInd(y,E.s);
trav(t,v) {
getInd(y,t.s.f);
getInd(y,t.s.s);
}
}
void init() {
setIO(); re(S,E);
x.pb(S.f), x.pb(E.f), y.pb(S.s), y.pb(E.s);
re(N);
F0R(i,N) {
int a,b,c,d; re(a,b,c,d);
v.pb({{a,b},{c,d}});
x.pb(a), x.pb(b), y.pb(c), y.pb(d);
}
compressX();
compressY();
F0R(i,MX) F0R(j,MX) F0R(k,5) dist[i][j][k] = MOD;
}
deque<array<int,3>> q;
void tri(int a, int b, int c, int d, int e) {
d += e;
if (d >= dist[a][b][c]) return;
dist[a][b][c] = d;
if (e) q.pb({a,b,c});
else q.push_front({a,b,c});
}
bool bad(int a, int b, int c) {
int A = a+xd[c], B = b+yd[c];
if (A < 1 || A > sz(x) || B < 1 || B > sz(y)) return 1;
if (c == 0) return badV[a][b];
if (c == 1) return badH[a][b];
if (c == 2) return badV[a][b-1];
if (c == 3) return badH[a-1][b];
exit(5);
}
int main() {
init();
trav(t,v) {
FOR(j,t.s.f+1,t.s.s) {
badH[t.f.f][j] ++;
badH[t.f.s][j] --;
}
FOR(i,t.f.f+1,t.f.s) {
badV[i][t.s.f] ++;
badV[i][t.s.s] --;
}
}
FOR(i,1,sz(x)+1) FOR(j,1,sz(y)+1) {
badH[i][j] += badH[i-1][j];
badV[i][j] += badV[i][j-1];
}
tri(S.f,S.s,4,0,0);
// ps(S,E,v);
// ps("??",sz(x),sz(y));
while (sz(q)) {
auto a = q.front(); q.pop_front(); int d = dist[a[0]][a[1]][a[2]];
//ps(a,d);
if (a[2] == 4) {
F0R(i,4) tri(a[0],a[1],i,d,1);
continue;
}
tri(a[0],a[1],4,d,0);
if (bad(a[0],a[1],a[2])) continue;
tri(a[0]+xd[a[2]],a[1]+yd[a[2]],a[2],d,0);
}
ps(dist[E.f][E.s][4]);
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
