1 int a[n],b[m],tmp[n+m];
2 int i=1,j=1,k=1;
3 while(i<=n&&j<=m)
4 {
5     if(a[i]<a[j])    tmp[k++]=a[i++];
6     else    tmp[k++]=b[j++];
7 }
8 while(i<=n)    tmp[k++]=a[i++];
9 while(j<=m) tmp[k++]=a[j++];

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#define LL long long
#define for1(i,n,m) for(int i=(n);i<=(m);i++)
#define for2(i,n,m) for(int i=(n);i>=(m);i--)
#define Maxn 305000
#define Maxe 506000
#define Inf 0x7fffffff
using namespace std;
int a[Maxn],tmp[Maxn];
LL ans;
struct edge{
    int x,v;
};
edge e[Maxn];
void Msort(int L,int R)//对区间(L,R)归并排序 
{

    int mid;            
    if(L>=R)            
        return;        //边界 
    mid=(L+R)>>1;        //以中点分治 
    Msort(L,mid);        
    Msort(mid+1,R);        //对俩部分依次归并排序 
    int i=L,j=mid+1,k=L;    
    while(i<=mid&&j<=R)        //归并 
    {    
        if(a[i]>a[j])
        {
            tmp[k++]=a[j++];
            ans+=mid-i+1;    //求逆序对数，注意这里是减i，不是L； 
        }
        else
            tmp[k++]=a[i++];
    }
    while(i<=mid)    tmp[k++]=a[i++];
    while(j<=R)        tmp[k++]=a[j++];    //剩余的扔进辅助数组 
    for1(t,L,R)
        a[t]=tmp[t];                    //更改原数组 
    
}
bool cmp(const edge&q,const edge&w)
{
    return q.x<w.x;
}
int main()
{
    ios::sync_with_stdio(0);
    int n;
    cin>>n;
    for1(i,1,n)
    {
        cin>>e[i].x>>e[i].v;
    }
    sort(e+1,e+n+1,cmp);
    for1(i,1,n)
    {
        a[i]=e[i].v;
    }
    Msort(1,n);
    cout<<ans;
    return 0;
}