There are n points on the plane, the i-th of which is at (x_i, y_i). Tokitsukaze wants to draw a strange rectangular area and pick all the points in the area.

The strange area is enclosed by three lines, x = l, y = a and x = r, as its left side, its bottom side and its right side respectively, where l, r and a can be any real numbers satisfying that l < r. The upper side of the area is boundless, which you can regard as a line parallel to the x-axis at infinity. The following figure shows a strange rectangular area.

<image>

A point (x_i, y_i) is in the strange rectangular area if and only if l < x_i < r and y_i > a. For example, in the above figure, p_1 is in the area while p_2 is not.

Tokitsukaze wants to know how many different non-empty sets she can obtain by picking all the points in a strange rectangular area, where we think two sets are different if there exists at least one point in one set of them but not in the other.

Input

The first line contains a single integer n (1 ≤ n ≤ 2 × 10^5) — the number of points on the plane.

The i-th of the next n lines contains two integers x_i, y_i (1 ≤ x_i, y_i ≤ 10^9) — the coordinates of the i-th point.

All points are distinct.

Output

Print a single integer — the number of different non-empty sets of points she can obtain.

Examples

Input

3
1 1
1 2
1 3


Output

3


Input

3
1 1
2 1
3 1


Output

6


Input

4
2 1
2 2
3 1
3 2


Output

6

Note

For the first example, there is exactly one set having k points for k = 1, 2, 3, so the total number is 3.

For the second example, the numbers of sets having k points for k = 1, 2, 3 are 3, 2, 1 respectively, and their sum is 6.

For the third example, as the following figure shows, there are

  * 2 sets having one point; 
  * 3 sets having two points; 
  * 1 set having four points. 



Therefore, the number of different non-empty sets in this example is 2 + 3 + 0 + 1 = 6.

<image>
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
	public static void main(String[] args) throws Exception {
		new template().run();
	}
	public void run() throws Exception {
		FastScanner f = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = f.nextInt();
		TreeSet<Integer> ts = new TreeSet<>();
		PriorityQueue<Pair> pq = new PriorityQueue<>();
		for(int i = 0; i < n; i++) {
			int a = f.nextInt(), b = f.nextInt();
			ts.add(a);
			pq.add(new Pair(a,b));
		}
		HashMap<Integer,Integer> hm = new HashMap<>();
		int sz = 0;
		for(int i : ts) hm.put(i,sz++);
		long ans = 0;
		boolean[] exists = new boolean[n];
		long tot = 0;
		BIT b = new BIT(sz);
		while(!pq.isEmpty()) {
			int y = pq.peek().b;
			int prev = -1;
			while(!pq.isEmpty() && pq.peek().b == y) {
				int x = hm.get(pq.poll().a);
				if(!exists[x]) {
					exists[x] = true;
					b.add(x);
					tot++;
				}
				long t = b.get(prev, x-1);
				ans -= t * (t+1)/2;
				prev = x;
			}
			long t = b.get(sz, prev-1);
			ans += tot * (tot+1)/2 - t * (t+1)/2;
		}
		out.println(ans);
///
		out.flush(); 
	}
	class BIT {
		int[] arr;
		public BIT(int sz) {
			arr = new int[sz+5];
		}
		public int get(int l, int r) {
			return get(r) - get(l);
		}
		public void add(int i) {
			i++;
			while(i < arr.length) {
				arr[i]++;
				i += i & -i;
			}
		}
		public int get(int i) {
			i++;
			int res = 0;
			while(i > 0) {
				res += arr[i];
				i -= i & -i;
			}
			return res;
		}
	}
	class Pair implements Comparable<Pair> {
		int a, b;
		public Pair(int a, int b) {
			this.a = a;
			this.b = b;
		}
		public int compareTo(Pair p) {
			if(b == p.b) return Integer.compare(a, p.a);
			return -Integer.compare(b, p.b);
		}
	}
///
    static class FastScanner {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public FastScanner() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
        	return Long.parseLong(next());
        }
        public double nextDouble() {
        	return Double.parseDouble(next());
        }
        public String nextLine() {
        	try {
        		return reader.readLine();
        	} catch(IOException e) {
        		throw new RuntimeException(e);
        	}
        }
    }
}