description: Monocarp is the coach of the Berland State University programming teams. He decided to compose a problemset for a training session for his teams.
  
  Monocarp has n problems that none of his students have seen yet. The i-th problem has a topic a_i (an integer from 1 to n) and a difficulty b_i (an integer from 1 to n). All problems are different, that is, there are no two tasks that have the same topic and difficulty at the same time.
  
  Monocarp decided to select exactly 3 problems from n problems for the problemset. The problems should satisfy at least one of two conditions (possibly, both):
  
    * the topics of all three selected problems are different; 
    * the difficulties of all three selected problems are different. 
  
  
  
  Your task is to determine the number of ways to select three problems for the problemset.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 50000) — the number of testcases.
  
  The first line of each testcase contains an integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the number of problems that Monocarp have.
  
  In the i-th of the following n lines, there are two integers a_i and b_i (1 ≤ a_i, b_i ≤ n) — the topic and the difficulty of the i-th problem.
  
  It is guaranteed that there are no two problems that have the same topic and difficulty at the same time.
  
  The sum of n over all testcases doesn't exceed 2 ⋅ 10^5.
  
  Output
  
  Print the number of ways to select three training problems that meet either of the requirements described in the statement.
  
  Example
  
  Input
  
  
  2
  4
  2 4
  3 4
  2 1
  1 3
  5
  1 5
  2 4
  3 3
  4 2
  5 1
  
  
  Output
  
  
  3
  10
  
  Note
  
  In the first example, you can take the following sets of three problems:
  
    * problems 1, 2, 4; 
    * problems 1, 3, 4; 
    * problems 2, 3, 4. 
  
  
  
  Thus, the number of ways is equal to three.
solution: //jai Shree Krishna
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.util.Collections;
  import java.util.HashMap;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Random;
  import java.util.StringTokenizer;
  public class D{
  // author: Tarun Verma
  	static FastScanner sc = new FastScanner();
  	static int inf = Integer.MAX_VALUE;
  	static long mod = 1000000007;
  	
  	/* Common Mistakes By Me
  	 * make sure to read the bottom part of question
  	 * special cases (n=1?)
  	 * In Game Theory Check your solution and consider all the solutions
  	 * Always initialise value to the declare array in local scope
  	 * don't use debugs in interactive problems
  	 * Always Reset vis,adj array upto n+1 otherwise can cause TLE
  	 */
  	public static void solve() {
  		long n = sc.nextLong();
  		HashMap<Long, Long> T = new HashMap<>();
  		HashMap<Long, Long> D = new HashMap<>();
  		pair arr[] = new pair[(int) n];
  		for(int i =0;i<n;i++) {
  			long u = sc.nextLong();
  			long v = sc.nextLong();
  			arr[i] = new pair(u, v);
  			T.put(u, T.getOrDefault(u, 0l) + 1l);
  			D.put(v, D.getOrDefault(v, 0l) + 1l);
  		}
  		long ans = (n-2)*(n-1)*n/6;
  		
  		for(pair i: arr) {
  			ans -= (T.get(i.fr) - 1) * (D.get(i.sc) - 1);
  		}
  		System.out.println(ans);
  		
  	}
  	
  	public static void main(String[] args) {
  		int t = 1;
  		t = sc.nextInt();
  		outer: for (int tt = 0; tt < t; tt++) {
  			solve();
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////
  ////////////////////DO NOT BELOW BEFORE THIS LINE //////////////////////////////////
  ////////////////////////////////////////////////////////////////////////////////////
  	
  	static boolean isPalindrom(char[] arr, int i, int j) {
  		boolean ok = true;
  		while (i <= j) {
  			if (arr[i] != arr[j]) {
  				ok = false;
  				break;
  			}
  			i++;
  			j--;
  		}
  		return ok;
  	}
  	
  	static int max(int a, int b) {
  		return Math.max(a, b);
  	}
  	
  	static int min(int a, int b) {
  		return Math.min(a, b);
  	}
  	
  	static long max(long a, long b) {
  		return Math.max(a, b);
  	}
  	
  	static long min(long a, long b) {
  		return Math.min(a, b);
  	}
  	static void sort(int arr[]) {
  		ArrayList<Integer> a = new ArrayList<Integer>();
  		for(int i: arr) a.add(i);
  		Collections.sort(a);
  		for(int i=0;i<arr.length;i++) arr[i] = a.get(i);
  	}
  	static void sort(long arr[]) {
  		ArrayList<Long> a = new ArrayList<Long>();
  		for(long i: arr) a.add(i);
  		Collections.sort(a);
  		for(int i=0;i<arr.length;i++) arr[i] = a.get(i);
  	}
  	static int abs(int a) {
  		return Math.abs(a);
  	}
  	
  	static long abs(long a) {
  		return Math.abs(a);
  	}
  	
  	static void swap(long arr[], int i, int j) {
  		long temp = arr[i];
  		arr[i] = arr[j];
  		arr[j] = temp;
  	}
  	
  	static void swap(int arr[], int i, int j) {
  		int temp = arr[i];
  		arr[i] = arr[j];
  		arr[j] = temp;
  	}
  	
  	static int maxArr(int arr[]) {
  		int maxi = Integer.MIN_VALUE;
  		for (int x : arr)
  			maxi = max(maxi, x);
  		return maxi;
  	}
  	
  	static int minArr(int arr[]) {
  		int mini = Integer.MAX_VALUE;
  		for (int x : arr)
  			mini = min(mini, x);
  		return mini;
  	}
  	
  	static long maxArr(long arr[]) {
  		long maxi = Long.MIN_VALUE;
  		for (long x : arr)
  			maxi = max(maxi, x);
  		return maxi;
  	}
  	
  	static long minArr(long arr[]) {
  		long mini = Long.MAX_VALUE;
  		for (long x : arr)
  			mini = min(mini, x);
  		return mini;
  	}
  	
  	static int gcd(int a, int b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	
  	static long gcd(long a, long b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	
  	static void ruffleSort(int[] a) {
  		int n = a.length;
  		Random r = new Random();
  		for (int i = 0; i < a.length; i++) {
  			int oi = r.nextInt(n);
  			int temp = a[i];
  			a[i] = a[oi];
  			a[oi] = temp;
  		}
  		Arrays.sort(a);
  	}
  	
  	public static int binarySearch(int a[], int target) {
  		int left = 0;
  		int right = a.length - 1;
  		int mid = (left + right) / 2;
  		int i = 0;
  		while (left <= right) {
  			if (a[mid] <= target) {
  				i = mid + 1;
  				left = mid + 1;
  			} else {
  				right = mid - 1;
  			}
  			mid = (left + right) / 2;
  		}
  		return i;
  	}
  	
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		
  		int[] readArray(int n) {
  			int[] a = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  		
  		long[] readLongArray(int n) {
  			long[] a = new long[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextLong();
  			return a;
  		}
  		
  		int[][] read2dArray(int n, int m) {
  			int arr[][] = new int[n][m];
  			for (int i = 0; i < n; i++) {
  				for (int j = 0; j < m; j++) {
  					arr[i][j] = nextInt();
  				}
  			}
  			return arr;
  		}
  		
  		ArrayList<Integer> readArrayList(int n) {
  			ArrayList<Integer> arr = new ArrayList<Integer>();
  			for (int i = 0; i < n; i++) {
  				int a = nextInt();
  				arr.add(a);
  			}
  			return arr;
  		}
  		
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	
  	static class pair {
  		long fr, sc;
  		
  		pair(long fr, long sc) {
  			this.fr = fr;
  			this.sc = sc;
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////	
  	
  }
  