Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi, yi).

They need to arrange a plan, but there are some difficulties on their way. As you know, Doctor Manhattan considers the distance between watchmen i and j to be |xi - xj| + |yi - yj|. Daniel, as an ordinary person, calculates the distance using the formula <image>.

The success of the operation relies on the number of pairs (i, j) (1 ≤ i < j ≤ n), such that the distance between watchman i and watchmen j calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs.

Input

The first line of the input contains the single integer n (1 ≤ n ≤ 200 000) — the number of watchmen.

Each of the following n lines contains two integers xi and yi (|xi|, |yi| ≤ 109).

Some positions may coincide.

Output

Print the number of pairs of watchmen such that the distance between them calculated by Doctor Manhattan is equal to the distance calculated by Daniel.

Examples

Input

3
1 1
7 5
1 5


Output

2


Input

6
0 0
0 1
0 2
-1 1
0 1
1 1


Output

11

Note

In the first sample, the distance between watchman 1 and watchman 2 is equal to |1 - 7| + |1 - 5| = 10 for Doctor Manhattan and <image> for Daniel. For pairs (1, 1), (1, 5) and (7, 5), (1, 5) Doctor Manhattan and Daniel will calculate the same distances.
//package c345;

import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;


public class q3
{

	
	   public static void main(String args[])
	   {
		   FasterScanner s=new FasterScanner();  
		   int n=s.nextInt();
		   long x[]=new long[n];
		   long y[]=new long[n];
		   node no[]=new node[n];
		   for(int i=0;i<n;i++)
		   {
			   long x1=s.nextLong();
			   long y1=s.nextLong();
			   x[i]=x1;
			   y[i]=y1;
			   no[i]=new node(x1,y1);
		   }
		   Arrays.sort(x);

		   Arrays.sort(y);

		   Arrays.sort(no);
		   
		   long ans=0;
		   long xf=1,yf=1,nf=1;
		   for(int i=1;i<n;i++)
		   {
			   if(x[i]==x[i-1])
				   xf++;
			   else
				   {
				   ans+=(xf*(xf-1)/2);
				   xf=1;
				   }
			   
			   if(y[i]==y[i-1])
				   yf++;
			   else
			   {
				   ans+=(yf*(yf-1)/2);
				   yf=1;
			   }
			   
			   if(no[i].x==no[i-1].x && no[i].y==no[i-1].y)
				   nf++;
			   else
			   {
				   ans-=(nf*(nf-1)/2);
				   nf=1;
			   }
		   }
		   ans+=(xf*(xf-1)/2);
		   ans+=(yf*(yf-1)/2);
		   ans-=(nf*(nf-1)/2);
		   System.out.println(ans);
		}
	   
	   static class node implements Comparable<node>
	   {
		   long x,y;
		   public node(long x,long y)
		   {
			   this.x=x;
			   this.y=y;
		   }
		@Override
		public int compareTo(node arg0) {
			// TODO Auto-generated method stub
			if(this.x!=arg0.x)
				return (int)(this.x-arg0.x);
			else
				return (int)(this.y-arg0.y);
		}
	   }
	   
		public static long gcd(long a, long b) 
		{

			if(a==b)
				return a;
			if(a==0)
				return b;
			if(b==0)
				return a;

			if(a>b)
				return gcd(b,a%b);
			else
				return gcd(a,b%a);
		}

		public static long modPow( long a, long b, long mod )
	    {
	    	long res=1,pow=a;
	    	while( b>0 )
	    	{
	    		if( (b&1)==1 )
	    		{
	    			res = (pow*res)%mod;
	    		}
	    		pow = (pow*pow)%mod;
	    		b=b/2;
	    	}
	    	return res;
	    }
		
		static class nck
		{
			public static long ncr[][];
			
			public nck(long z,long p)//z==maxvalue  p==mod
			{
				generateNCR(z, p);
			}
			
		    private static void generateNCR( long z, long p )
		    {
		    	ncr = new long[(int)z+1][(int)z+1];
		    	ncr[0][0] = 1;
		    	for(int i=1; i<=z; i++)
		    	{
		    		ncr[i][0] = 1;
		    		ncr[0][i] = 0;
		    	}
		        for(int i=1; i<=z; i++)
		        {
		            for(int j=1; j<=z; j++)
		            {
		                ncr[i][j] = (ncr[i-1][j] + ncr[i-1][j-1]) % p;
		            }
		        }
		    }

		    private static long lucas(long n, long k, long p) 
		    {
		    
		        long ans = 1;
		        
		        while(n>0)
		        {
		            int N = (int)(n%p);
		            int K = (int)(k%p);
		            if(K>N)
		                return 0;
		            ans *= (ncr[N][K] );
		            n /= p;
		            k /= p;
		        }
		        return ans % p;
			
	    }
		}
		
		
		

		
		

		
		
		
		
		static class SegTree
		{
			static int seg[];
			static int dp[];
			int n;
			int d;
			public SegTree(int[] arr,int defaul)
			{
				this.dp=arr;
				n=dp.length;
				seg=new int[4*arr.length];
				build(1,0,n);
				this.d=defaul;
			}

			public void build(int id,int l,int r){
				if(r-l<2){
					seg[id]=dp[l];
					return;
				}
				int mid=(l+r)/2;
				build(2*id,l,mid);
				build(2*id+1,mid,r);
				seg[id]=merge(seg[2*id],seg[2*id+1]);
			}

			public int query(int l,int r)
			{
				return givemin(1,l,r,0,n);
			}

			public  int givemin(int id,int x,int y,int l,int r){
				if(x<=l && y>=r){
					return seg[id];
				}
				if(y<=l || r<=x){
					return d;
				}
				int mid=(l+r)/2;
				return merge(givemin(2*id, x, y, l, mid),givemin(2*id+1, x, y, mid, r));
			}

			public int upd(int id,int value)
			{
				return update(1,id,value,0,n);
			}
			public  int update(int id,int p,int value,int l,int r){
				if(r-l<2){
					dp[p]=value;
					seg[id]=value;
					return value;
				}
				int mid=(l+r)/2;
				if(p<mid){
					update(2*id, p, value, l, mid);
					seg[id]=merge(seg[2*id], seg[2*id+1]);
					return seg[id];
				}
				else{
					update(2*id+1, p, value, mid,r);
					seg[id]=merge(seg[2*id+1], seg[2*id]);
					return seg[id];

				}
			}

			public int merge(int l,int r)
			{

				//set initial value
				return l+r;
			}
		}


		static class UF {

			private int[] parent;  // parent[i] = parent of i
			private byte[] rank;   // rank[i] = rank of subtree rooted at i (never more than 31)
			private int count;   
			int[] seg;
			int max;
			// number of components
			public UF(int N) {
				if (N < 0) throw new IllegalArgumentException();
				count = N;
				parent = new int[N];
				rank = new byte[N];
				seg=new int[N];
				for (int i = 0; i < N; i++) {
					parent[i] = i;
					rank[i] = 0;
					seg[i]=1;
				}
				max=1;
			}

			public int find(int p) {
				if (p < 0 || p >= parent.length) throw new IndexOutOfBoundsException();
				while (p != parent[p]) {
					parent[p] = parent[parent[p]];    // path compression by halving
					p = parent[p];
				}
				return p;
			}
			public int count() {
				return count;
			}

			public boolean connected(int p, int q) {
				return find(p) == find(q);
			}

			public boolean union(int p, int q) {
				//    System.out.println("uf "+p+" "+q);
				int rootP = find(p);
				int rootQ = find(q);
				if (rootP == rootQ) return false;

				// make root of smaller rank point to root of larger rank
				if      (rank[rootP] < rank[rootQ])
				{
					parent[rootP] = rootQ;
					seg[rootQ]+=seg[rootP];
					max=Math.max(seg[rootQ],max);
				}
				else if (rank[rootP] > rank[rootQ])
				{
					parent[rootQ] = rootP;
					seg[rootP]+=seg[rootQ];
					max=Math.max(seg[rootP],max);
				}
				else {
					parent[rootQ] = rootP;
					rank[rootP]++;
					seg[rootP]+=seg[rootQ];
					max=Math.max(seg[rootP],max);
				}
				count--;
				return true;
			}

		}



		static class SparseTable
		{
			int[][] st;
			public SparseTable(int[] h){
				int n=h.length;
				int MAX_LOG=(int)Math.ceil(Math.log(n)/Math.log(2))+1;
				st=new int[n][MAX_LOG];
				for (int i = 0; i < n; i++)
					st[i][0] = h[i];
				for (int j = 1; (1 << j) <= n; j++)
				{
					for (int i = 0;( i + (1 << j) - 1 )< n; i++)
					{
						st[i][j]=Math.max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
					}
				}
			}
			public int query(int l,int r)
			{
				int x=(int )Math.floor((Math.log(r-l+1)/Math.log(2)));
				int ans=Math.max(st[l][x],st[r-(1<<x)+1][x]);
				return ans;
			}

		}

		public static class FasterScanner {
			private byte[] buf = new byte[1024];
			private int curChar;
			private int numChars;

			public int read() {
				if (numChars == -1)
					throw new InputMismatchException();
				if (curChar >= numChars) {
					curChar = 0;
					try {
						numChars = System.in.read(buf);
					} catch (IOException e) {
						throw new InputMismatchException();
					}
					if (numChars <= 0)
						return -1;
				}
				return buf[curChar++];
			}

			public String nextLine() {
				int c = read();
				while (isSpaceChar(c))
					c = read();
				StringBuilder res = new StringBuilder();
				do {
					res.appendCodePoint(c);
					c = read();
				} while (!isEndOfLine(c));
				return res.toString();
			}

			public String nextString() {
				int c = read();
				while (isSpaceChar(c))
					c = read();
				StringBuilder res = new StringBuilder();
				do {
					res.appendCodePoint(c);
					c = read();
				} while (!isSpaceChar(c));
				return res.toString();
			}

			public long nextLong() {
				int c = read();
				while (isSpaceChar(c))
					c = read();
				int sgn = 1;
				if (c == '-') {
					sgn = -1;
					c = read();
				}
				long res = 0;
				do {
					if (c < '0' || c > '9')
						throw new InputMismatchException();
					res *= 10;
					res += c - '0';
					c = read();
				} while (!isSpaceChar(c));
				return res * sgn;
			}

			public int nextInt() {
				int c = read();
				while (isSpaceChar(c))
					c = read();
				int sgn = 1;
				if (c == '-') {
					sgn = -1;
					c = read();
				}
				int res = 0;
				do {
					if (c < '0' || c > '9')
						throw new InputMismatchException();
					res *= 10;
					res += c - '0';
					c = read();
				} while (!isSpaceChar(c));
				return res * sgn;
			}

			public int[] nextIntArray(int n) {
				int[] arr = new int[n];
				for (int i = 0; i < n; i++) {
					arr[i] = nextInt();
				}
				return arr;
			}

			public long[] nextLongArray(int n) {
				long[] arr = new long[n];
				for (int i = 0; i < n; i++) {
					arr[i] = nextLong();
				}
				return arr;
			}

			private boolean isSpaceChar(int c) {
				return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
			}

			private boolean isEndOfLine(int c) {
				return c == '\n' || c == '\r' || c == -1;
			}
		}


}
