#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define dg(x) cerr<<"line: "<<__LINE__<<" "<<#x<<": "<<x<<endl
#define gc()(xS==xTT&&(xTT=(xS=xB)+fread(xB,1,1<<20,stdin),xS==xTT)?0:*xS++)
#define pc(x)(p3-obuf<1000000)?(*p3++=x):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=x)
using namespace std;typedef long long ll;typedef double db;typedef long double ld;typedef unsigned long long ull;typedef unsigned int ui;char xch,xB[1<<20],*xS=xB,*xTT=xB,obuf[1000000],*p3=obuf;inline ll read(){char ch=gc();ll x=0,f=1;while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}while('0'<=ch&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=gc();}return x*f;}static char cc[20];template<typename item>inline void pt( item x){ int len=0;if(!x)pc('0');if(x<0)x=-x,pc('-');while(x)cc[len++]=x%10+'0',x/=10;while(len--)pc(cc[len]);}inline void pS(string s){for(int i=0;i<s.length();i++)pc(s[i]);}inline ll read2(){char ch=gc();ll x=0,f=1;while(ch<'0'||ch>'1'){if(ch=='-')f=-1;ch=gc();}while('0'<=ch&&ch<='9'){x=(x<<1)+(ch^48);ch=gc();}return x*f;}inline __int128 iread(){char ch=gc();__int128 x=0,f=1;while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}while('0'<=ch&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=gc();}return x*f;}
const int maxn=1e5+10;
int n,x[maxn],y[maxn],z[maxn],t[maxn];ll ans;
void cdq3(vector<pii>&ds)
{
	if(ds.size()<2)return;
	nth_element(ds.begin(),ds.begin()+(ds.size()-1>>1),ds.end(),[](pii A,pii B){return z[A.fi]<z[B.fi];});int mid=z[ds[ds.size()-1>>1].fi];
	vector<pii>L((ds.size()-1>>1)+1),R(ds.size()-L.size());int p1=0,p2=0;for(auto &t:ds)if(z[t.fi]<=mid)L[p1++]=t;else R[p2++]=t;
	cdq3(L),cdq3(R);
	p1=0,p2=-1;int cnt=0;
	for(;p1<R.size();p1++)
	{
		if(!R[p1].se)continue;
		while(p2<(int)L.size()-1&&t[L[p2+1].fi]<t[R[p1].fi]){p2++;cnt+=!L[p2].se;}
		ans+=cnt;
	}
	p1=p2=0;int p3=0;while(p1<L.size()&&p2<R.size())if(t[L[p1].fi]<t[R[p2].fi])ds[p3]=L[p1],p1++,p3++;else ds[p3]=R[p2],p2++,p3++;
	while(p1<L.size())ds[p3]=L[p1],p1++,p3++;
	while(p2<R.size())ds[p3]=R[p2],p2++,p3++;
}
void cdq2(vector<pii>&ds)
{
	if(ds.size()<2)return;
	nth_element(ds.begin(),ds.begin()+(ds.size()-1>>1),ds.end(),[](pii A,pii B){return y[A.fi]<y[B.fi];});int mid=y[ds[ds.size()-1>>1].fi];
	vector<pii>L((ds.size()-1>>1)+1),R(ds.size()-L.size());int p1=0,p2=0,p3=0,c=0;for(auto t:ds)if(y[t.fi]<=mid){L[p1++]=t;if(!t.se)c++;}else {R[p2++]=t;if(t.se)c++;}
	vector<pii>T(c);for(auto t:L)if(!t.se)T[p3++]=t;for(auto t:R)if(t.se)T[p3++]=t;
	cdq3(T);cdq2(L),cdq2(R);
}
void cdq1(vector<pii>&ds,int l,int r)
{
	if(l==r)return;
	int mid=l+r>>1;
	vector<pii>L(mid-l+1<<1),R(r-mid<<1),T(r-l+1);int p1=0,p2=0,p3=0;for(auto t:ds)if(x[t.fi]<=mid){L[p1++]=t;if(!t.se)T[p3++]=t;}else {R[p2++]=t;if(t.se)T[p3++]=t;}
	cdq2(T);cdq1(L,l,mid),cdq1(R,mid+1,r);
}
signed main()
{
	n=read();
	for(int i=1;i<=n;i++)x[i]=read(),y[i]=read(),z[i]=read(),t[i]=read();
	vector<pii>ps;for(int i=1;i<=n;i++)ps.push_back({i,0}),ps.push_back({i,1});
	cdq1(ps,1,n);
	pt(ans);
	fwrite(obuf,p3-obuf,1,stdout);
	return 0;
}