#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, i, j;
	cin >> n;

	map<int, int> row, col;
	map<array<int, 2>, int> points;
	for (i = 0; i < n; i++)
	{
		int x, y;
		cin >> x >> y;
		row[x]++;
		col[y]++;
		points[{x, y}]++;
	}

	long long ans = 0;
	for (pair<array<int, 2>, int> ps : points)
	{
		int x = ps.first[0], y = ps.first[1];
		ans += ps.second * (row[x] - points[{x, y}])* (col[y] - points[{x, y}]);
	}
	cout << ans;
}