n=int(input())
p=[tuple(map(int,input().split())) for i in range(n)]
a=0


class FenwickTree:
  def __init__(self,n):
    self.n=n
    self.q=[0]*n
  
  def add(self,p,x):
    p+=1
    while p<=self.n:
      self.q[p-1]+=x
      p+=p&(-p)
  
  def sum(self,l,r):
    return self._sum(r)-self._sum(l)
  
  def _sum(self,r):
    a=0
    while r>0:
      a+=self.q[r-1]
      r-=r&(-r)
    return a


L=10**6+1
st=FenwickTree(L)
for l,r in p:
  a+=st.sum(0,l)
  st.add(l,1)
st=FenwickTree(L)
for l,r in p:
  a+=st.sum(r,L)
  st.add(r,1)
p.sort()
st=FenwickTree(L)
for l,r in p:
  a+=st.sum(r,L)
  st.add(r,1)
a-=n*(n-1)//2
a//=2
print(a)