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: /*
                         _oo0oo_
                        o8888888o
                        88" . "88
                        (| -_- |)
                        0\  =  /0
                      ___/`---'\___
                    .' \\|     |// '.
                   / \\|||  :  |||// \
                  / _||||| -:- |||||- \
                 |   | \\\  -  /// |   |
                 | \_|  ''\---/''  |_/ |
                 \  .-\__  '-'  ___/-. /
               ___'. .'  /--.--\  `. .'___
            ."" '<  `.___\_<|>_/___.' >' "".
           | | :  `- \`.;`\ _ /`;.`/ - ` : | |
           \  \ `_.   \_ __\ /__ _/   .-` /  /
       =====`-.____`.___ \_____/___.-`___.-'=====
                         `=---='
   
  */
  
  import java.util.*;
  import java.math.*;
  import java.io.*;
  import java.lang.Math.*;
  
  public class KickStart2020 {
  	 static class FastReader {
  		BufferedReader br;
  		StringTokenizer st;
  
  		public FastReader() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}
  
  		String next() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		float nextFloat() {
  			return Float.parseFloat(next());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  	}
  
  	static long gcd(long a, long b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  
  	}
  
  	static long lcm(long a, long b) {
  		return a / gcd(a, b) * b;
  	}
  
  	public static class Pair implements Comparable<Pair> {
  		public int index;
  		public int value;
  
  		public Pair(int index, int value) {
  			this.index = index;
  			this.value = value;
  		}
  
  		@Override
  		public int compareTo(Pair other) {
  			// multiplied to -1 as the author need descending sort order
  			if(other.index < this.index) return 1;
  			if(other.index > this.index) return -1;
  			else return 0;
  		}
  		@Override
  		public String toString() {
  			return this.index + " " + this.value;
  		}
  	}
  	static boolean isPrime(long d) {
  		if (d == 1)
  			return false;
  		for (int i = 2; i <= (long) Math.sqrt(d); i++) {
  			if (d % i == 0)
  				return false;
  		}
  		return true;
  	}
  
  	static void decimalTob(int n, int k, Stack<Integer> ss) {
            int x = n % k;
            int y = n / k;
            ss.push(x);
            if(y > 0) {
          	   decimalTob(y, k, ss);
            }
  	}
  
  	static long powermod(long x, long y, long mod) {
  		long ans = 1;
  		x = x % mod;
  		if (x == 0)
  			return 0;
  		int i = 1;
  		while (y > 0) {
  			if ((y & 1) != 0)
  				ans = (ans * x) % mod;
  			y = y >> 1;
  			x = (x * x) % mod;
  		}
  		return ans;
  	}
  	public static void main(String[] args) throws Exception {
  		FastReader sc = new FastReader();
  		PrintWriter out = new PrintWriter(System.out);
          int t = sc.nextInt();
          outerloop:
          while(t-- > 0) {
          int n = sc.nextInt();
          int arr[] = new int[n];
          int brr[] = new int[n];
          int count[] = new int[n + 1];
          int count1[] = new int[n + 1];
          for(int i = 0; i < n; i++) {
          	count[arr[i]= sc.nextInt()]++;
          	count1[brr[i]= sc.nextInt()]++;
          }
          long ans = (long)(n) * (n - 1) * (n - 2) / 6;
          for(int i = 0; i < n; i++) {
          	if(count[arr[i]] == 0 || count1[brr[i]] == 0) continue;
          	ans -= (long)(count[arr[i]] - 1) * (count1[brr[i]] - 1);
          }
          out.println(ans);
          }
  		out.close();
  	}
  }