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: //package codeforces;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  public class solution{ 
  	public static void main(String[] args){
      	FastScanner s=new FastScanner();
      	PrintWriter out=new PrintWriter(System.out);
      	int t=s.nextInt();
      	for(int tt=0;tt<t;tt++) {
      		int n=s.nextInt();
      		int a[][]=new int[n][2];
      		for(int i=0;i<n;i++) {
      			a[i][0]=s.nextInt()-1;
      			a[i][1]=s.nextInt()-1;
      		}
      		int c[]=new int[n],d[]=new int[n];
      		for(int i=0;i<n;i++) {
      			c[a[i][0]]++;
      			d[a[i][1]]++;
      		}
      		long ans=((long)n*(n-1)*(n-2))/6;
      		for(int i=0;i<n;i++) {
      			ans-=(long)(c[a[i][0]]-1)*(d[a[i][1]]-1);
      		}
      		out.println(ans);
      	}
      	out.close();
  	}
  	public static void printb(boolean ans) {
  		if(ans) {
  			System.out.println("Yes");
  		}else {
  			System.out.println("No");
  		}
  	}
  	static boolean isPrime(int n){
          if (n <= 1)
              return false;
          else if (n == 2)
              return true;
          else if (n % 2 == 0)
              return false;
          for (int i = 3; i <= Math.sqrt(n); i += 2){
              if (n % i == 0)
                  return false;
          }
          return true;
      }
  	static int gcd(int a, int b){
  	      if (b == 0)
  	        return a;
  	      return gcd(b, a % b);
  	    }
      static void sort(long [] a) {
  		ArrayList<Long> l=new ArrayList<>();
  		for (long i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  	}
      static void sort(int [] a) {
  		ArrayList<Integer> l=new ArrayList<>();
  		for (int i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(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();
  		}
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		boolean nextBoolean() {
  			return Boolean.parseBoolean(next());
  		}
  		int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  		long[] readLongArray(int n) {
  			long[] a=new long[n];
  			for (int i=0; i<n; i++) a[i]=nextLong();
  			return a;
  		}
  	}
      static class Pair implements Comparable<Pair>{
      	int a,b ; 
      	Pair(int a,int b){
      		this.a=a;
      		this.b=b;
      	}
      	public int compareTo(Pair o) {
      		return a-o.a;
      	}
      }
  }
  