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 currentContest;
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayDeque;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.List;
  import java.util.Random;
  import java.util.StringTokenizer;
  import java.util.TreeSet;
  
  public class P1 {
  	public static void main(String[] args) {
  		// TODO Auto-generated method stub
  		int t = sc.nextInt();
  		StringBuilder st = new StringBuilder();
  		while (t-- != 0) {
  			int n=sc.nextInt();
  			int p[][]=new int[n][2];
  			long to[]=new long[n+1];
  			int diff[]=new int[n+1];
  			Arrays.fill(diff,0);
  			for(int i=0;i<n;i++) {
  				p[i][0]=sc.nextInt();
  				p[i][1]=sc.nextInt();
  				to[p[i][0]]++;
  				diff[p[i][1]]++;
  			}
  			long ans=((long)(n)*((long)n-1)*(n-2))/6;
  			for(int i=0;i<n;i++) {
  				ans=ans-(to[p[i][0]]-1)*(diff[p[i][1]]-1);
  			}
  			st.append(ans+"\n");
  		}
  		System.out.println(st);
  	}
  
  	static FastReader sc = new FastReader();
  
  	public static void solvegraph() {
  		int n = sc.nextInt();
  
  		int edge[][] = new int[n - 1][2];
  		for (int i = 0; i < n - 1; i++) {
  			edge[i][0] = sc.nextInt() - 1;
  			edge[i][1] = sc.nextInt() - 1;
  		}
  		ArrayList<ArrayList<Integer>> ad = new ArrayList<>();
  		for (int i = 0; i < n; i++) {
  			ad.add(new ArrayList<Integer>());
  		}
  		for (int i = 0; i < n - 1; i++) {
  			ad.get(edge[i][0]).add(edge[i][1]);
  			ad.get(edge[i][1]).add(edge[i][0]);
  		}
  		int parent[] = new int[n];
  		Arrays.fill(parent, -1);
  		parent[0] = n;
  		ArrayDeque<Integer> queue = new ArrayDeque<>();
  		queue.add(0);
  		int child[] = new int[n];
  		Arrays.fill(child, 0);
  		ArrayList<Integer> lv = new ArrayList<Integer>();
  		while (!queue.isEmpty()) {
  			int toget = queue.getFirst();
  			queue.removeFirst();
  			child[toget] = ad.get(toget).size() - 1;
  			for (int i = 0; i < ad.get(toget).size(); i++) {
  				if (parent[ad.get(toget).get(i)] == -1) {
  					parent[ad.get(toget).get(i)] = toget;
  					queue.addLast(ad.get(toget).get(i));
  				}
  			}
  			lv.add(toget);
  		}
  
  		child[0]++;
  	}
  
  	static void sort(int[] A) {
  		int n = A.length;
  		Random rnd = new Random();
  		for (int i = 0; i < n; ++i) {
  			int tmp = A[i];
  			int randomPos = i + rnd.nextInt(n - i);
  			A[i] = A[randomPos];
  			A[randomPos] = tmp;
  		}
  		Arrays.sort(A);
  	}
  
  	static void sort(long[] A) {
  		int n = A.length;
  		Random rnd = new Random();
  		for (int i = 0; i < n; ++i) {
  			long tmp = A[i];
  			int randomPos = i + rnd.nextInt(n - i);
  			A[i] = A[randomPos];
  			A[randomPos] = tmp;
  		}
  		Arrays.sort(A);
  	}
  
  	static String sort(String s) {
  		Character ch[] = new Character[s.length()];
  		for (int i = 0; i < s.length(); i++) {
  			ch[i] = s.charAt(i);
  		}
  		Arrays.sort(ch);
  		StringBuffer st = new StringBuffer("");
  		for (int i = 0; i < s.length(); i++) {
  			st.append(ch[i]);
  		}
  		return st.toString();
  	}
  
  	public static long gcd(long a, long b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  
  	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());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  	}
  }
  