#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=1000010,N=10010;
typedef long long ll;
typedef double db;
int n,zn,hn;
struct line{int x,y,l;}z[N],h[N];
int ct;
vector<pair<int,int> >hj[N],zj[N];
int head[maxn],to[maxn],nxt[maxn],cot[maxn],cnt;
inline void addedge(int u,int v,int w){++cnt,to[cnt]=v,nxt[cnt]=head[u],head[u]=cnt,cot[cnt]=w;}
queue<int>q;
ll dis[100010];
inline void spfa(){
	memset(dis,0x3f,sizeof(dis));
	dis[0]=0;
	q.push(0);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(register int e=head[u];e;e=nxt[e]){
			int v=to[e];
			if(dis[u]+cot[e]<dis[v]){
				dis[v]=dis[u]+cot[e];
				q.push(v);
			}
		}
	}
}
inline void solve(){
	for(register int i=1;i<=n;++i){
		int a,b,c,d;
		scanf("%d%d%d%d",&a,&b,&c,&d);
	}
	ll sx,sy,tx,ty;scanf("%lld%lld%lld%lld",&sx,&sy,&tx,&ty);
	printf("%lld\n",abs(sx-tx)+abs(sy-ty));
}
int main(){
	scanf("%d",&n);
	if(n>200){solve();return 0;}
	for(register int i=1;i<=n;++i){
		int x1,y1,x2,y2;
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		if(x1>x2)swap(x1,x2),swap(y1,y2);
		if(y1>y2)swap(x1,x2),swap(y1,y2);
		if(x1<x2)++hn,h[hn].x=x1,h[hn].y=y1,h[hn].l=x2-x1;
		if(y1<y2)++zn,z[zn].x=x1,z[zn].y=y1,z[zn].l=y2-y1;
	}
	ct=2*n;
	for(register int i=1;i<=hn;++i)
		for(register int j=1;j<=zn;++j)
			if(z[j].x>=h[i].x&&z[j].x<=h[i].x+h[i].l&&z[j].y<=h[i].y&&z[j].y+z[j].l>=h[i].y){
				++ct;
				hj[i].push_back(make_pair(z[j].x,ct));
				zj[j].push_back(make_pair(h[i].y,ct));
			}
	int sx,sy,tx,ty;
	scanf("%d%d%d%d",&sx,&sy,&tx,&ty);
	for(register int i=1;i<=hn;++i){
		if(sx>=h[i].x&&sx<=h[i].x+h[i].l&&sy==h[i].y)hj[i].push_back(make_pair(sx,0));
		if(tx>=h[i].x&&tx<=h[i].x+h[i].l&&ty==h[i].y)hj[i].push_back(make_pair(tx,ct+1));
	}
	for(register int i=1;i<=zn;++i){
		if(sy>=z[i].y&&sy<=z[i].y+z[i].l&&sx==z[i].x)zj[i].push_back(make_pair(sy,0));
		if(ty>=z[i].y&&ty<=z[i].y+z[i].l&&tx==z[i].x)zj[i].push_back(make_pair(ty,ct+1));
	}
	for(register int i=1;i<=hn;++i){
		sort(hj[i].begin(),hj[i].end());
		if(hj[i].size ()==0)addedge(2*i-1,2*i,h[i].l),addedge(2*i,2*i-1,h[i].l);
		else{
			addedge(2*i-1,hj[i][0].second,hj[i][0].first-h[i].x);
			addedge(hj[i][0].second,2*i-1,hj[i][0].first-h[i].x);
			for(register unsigned int p=0; p<hj[i].size()-1;++p)
				addedge(hj[i][p].second,hj[i][p+1].second,hj[i][p+1].first-hj[i][p].first),
				addedge(hj[i][p+1].second,hj[i][p].second,hj[i][p+1].first-hj[i][p].first);
			addedge(hj[i][hj[i].size()-1].second,2*i,h[i].x+h[i].l-hj[i][hj[i].size()-1].first);
			addedge(2*i,hj[i][hj[i].size()-1].second,h[i].x+h[i].l-hj[i][hj[i].size()-1].first);
		}
	}
	for(register int i=1;i<=zn;++i){
		sort(zj[i].begin(),zj[i].end());
		if(zj[i].size()==0)addedge(2*hn+2*i-1,2*hn+2*i,z[i].l),addedge(2*hn+2*i,2*hn+2*i-1,z[i].l);
		else{
			addedge(2*hn+2*i-1,zj[i][0].second,zj[i][0].first-z[i].y);
			addedge(zj[i][0].second,2*hn+2*i-1,zj[i][0].first-z[i].y);
			for(register unsigned int p=0;p<zj[i].size()-1;++p)
				addedge(zj[i][p].second,zj[i][p+1].second,zj[i][p+1].first-zj[i][p].first),
				addedge(zj[i][p+1].second,zj[i][p].second,zj[i][p+1].first-zj[i][p].first);
			addedge(zj[i][zj[i].size()-1].second,2*hn+2*i,z[i].y+z[i].l-zj[i][zj[i].size()-1].first);
			addedge(2*hn+2*i,zj[i][zj[i].size()-1].second,z[i].y+z[i].l-zj[i][zj[i].size()-1].first);
		}
	}
	for(register int i=1;i<=hn;++i)
		for(register int j=1;j<=hn;++j)if(i!=j&&h[i].y==h[j].y)
			if(h[i].x==h[j].x+h[j].l)addedge(2*i-1,2*j,0),addedge(2*j,2*i-1,0);
	for(register int i=1;i<=zn;++i)
		for(register int j=1;j<=zn;++j)if(i!=j&&z[i].x==z[j].x)
			if(z[i].y==z[j].y+z[j].l)addedge(2*hn+2*i-1,2*hn+2*j,0),addedge(2*hn+2*j,2*hn+2*i-1,0);
	spfa();
	printf("%lld\n",dis[ct+1]);
	return 0;
}