#include<cstdio>

 #include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #define ll long long

 #define ull unsigned long long

 #define d double

 using namespace std;

 const int maxn=,mxnode=maxn*;

 struct zs{int h,l,r;bool add;}b[maxn];int n1;

 struct mat{int x1,y1,x2,y2;}a[];

 int lc[mxnode],rc[mxnode],mn[mxnode],num[mxnode],add[mxnode],tot,MX;

 int i,j,k,n,m,L,R,V;

 ll ans;

 int ra,fh;char rx;

 inline int read(){

     rx=getchar(),ra=,fh=;

     while((rx<''||rx>'')&&rx!='-')rx=getchar();

     if(rx=='-')fh=-,rx=getchar();

     while(rx>=''&&rx<='')ra*=,ra+=rx-,rx=getchar();return ra*fh;

 }

 inline void ins(int &x,int l){x=++tot,mn[x]=add[x]=,num[x]=l;}

 inline void upd(int x){

     int l=lc[x],r=rc[x];

     if(mn[l]>mn[r])swap(l,r);

     if(mn[l]==mn[r])mn[x]=mn[l]+add[x],num[x]=num[l]+num[r];

     else mn[x]=mn[l]+add[x],num[x]=num[l];

 }

 void insert(int x,int a,int b){

 //    printf("insert:%d--%d      %d-----%d\n",a,b,L,R);

     if(L<=a&&R>=b){add[x]+=V,mn[x]+=V;return;}

     int mid=a+b>>;

     if(!lc[x])ins(lc[x],mid-a+);if(!rc[x])ins(rc[x],b-mid);

     if(L<=mid)insert(lc[x],a,mid);

     if(R>mid)insert(rc[x],mid+,b);

     upd(x);//printf("%d--%d  mn:%d   num:%d\n",a,b,mn[x],num[x]);

 }

 inline int get0(){return mn[]!=?:num[];}

 bool cmp(zs a,zs b){return a.h<b.h||(a.h==b.h&&a.add);}

 inline void calc(){

     int i;

     sort(b+,b++n1,cmp);

     for(i=;i<=tot;i++)lc[i]=rc[i]=;tot=,mn[]=add[]=,num[]=MX;

     for(i=;i<=n1;i++){

         L=b[i].l,R=b[i].r;

         if(b[i].add)ans+=get0(),V=,insert(,,MX),ans-=get0();

         else ans-=get0(),V=-,insert(,,MX),ans+=get0();//printf("num0:%d    mn:%d\n",get0(),mn[1]);

     }//printf("  ans:%d\n",ans);

 }

 inline int abs1(int x){return x<?-x:x;}

 inline int max(int a,int b){return a>b?a:b;}

 int main(){

     n=read();int tmp;

     for(i=;i<=n;i++){

         a[i].x1=read(),a[i].y1=read(),a[i].x2=read()-,a[i].y2=read()-;

         tmp=max(max(abs1(a[i].x1),abs1(a[i].x2)),max(abs1(a[i].y1),abs1(a[i].y2)));

         if(tmp>MX)MX=tmp;

     }

     for(i=;i<=n;i++)a[i].x1+=MX+,a[i].x2+=MX+,a[i].y1+=MX+,a[i].y2+=MX+;

     MX=MX<<|;

     n1=;

     for(i=;i<=n;i++)

         b[++n1]=(zs){a[i].x1,a[i].y1,a[i].y2,},

         b[++n1]=(zs){a[i].x2+,a[i].y1,a[i].y2,};

     calc();

     n1=;

     for(i=;i<=n;i++)

         b[++n1]=(zs){a[i].y1,a[i].x1,a[i].x2,},

         b[++n1]=(zs){a[i].y2+,a[i].x1,a[i].x2,};

     calc();

     printf("%lld\n",ans);

 }