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: // हर हर महादेव
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  import java.text.DecimalFormat;
  
  public final class Solution {
  
      static int inf = Integer.MAX_VALUE;
      static long mod = 1000000000 + 7;
    
     
  
  
    
   static void ne(Scanner sc, BufferedWriter op) throws Exception {
     int n=sc.nextInt();
     Map<Integer,Long> xc= new HashMap<>();
     Map<Integer,Long> yc= new HashMap<>();
   ArrayList<pair> list= new ArrayList<>();
     for(int i=0;i<n;i++){
         int x=sc.nextInt();
         int y=sc.nextInt();
         list.add(new pair(x,y));
        long cx=xc.get(x)==null? 0L : xc.get(x);
        long cy=yc.get(y)==null? 0L : yc.get(y);
        xc.put(x,cx+1);
        yc.put(y,cy+1);
     }
  
  
   long count=0;
  
     for(int i=0;i<n;i++){
        pair p=list.get(i);
      //  if(xc.containsKey(p.xx) && xc.containsKey(p.yy)){
           long val=xc.get(p.xx)-1;     
           long val2 =yc.get(p.yy)-1;  
          
          
           if(val!=0 && val2!=0){
                 count+=val*val2;
           }
          // }
  
      //   System.out.prinltn()   
     }
      long nn=(long)n;
     long total=((nn-2)*(nn-1)*(nn))/6L;
  //    System.out.println(total+"hey  "+count);
     long ans=total-count;
  //    if(ans<0){
  //        ans=0;
  //    }
     op.write(ans+"\n");
  
    }
    
    
  
  
  
  
      static int gcd(int a, int b){
          if(a==0) return b;
          return gcd(b%a,a);
      }
      static int lcm(int a, int b){
          return (a*b)/gcd(a,b);
      }
  
      public static void main(String[] args) throws Exception {
          BufferedWriter op = new BufferedWriter(new OutputStreamWriter(System.out));
          Scanner sc = new Scanner(System.in);
         
          int t = sc.nextInt();
          while (t-->0){ne(sc, op);}
          
          // ne(sc,op);
             
                     
          op.flush();
      }
  
      static void print(Object o) {
          System.out.println(String.valueOf(o));
      }
      static int[] toIntArr(String s){
          int[] val= new int[s.length()];
          for(int i=0;i<s.length();i++){
              val[i]=s.charAt(i)-'a';
          }
          return val;
      }
      static void  sort(int[] arr){
          ArrayList<Integer> list= new ArrayList<>();
          for(int i=0;i<arr.length;i++){
              list.add(arr[i]);
  
          }
          Collections.sort(list);
          for(int i=0;i<arr.length;i++){
              arr[i]=list.get(i);
          }
      }
  
  }
  
  // return -1 to put no ahed in array
  class pair {
      int xx;
  
      int yy;
  
  
      pair(int xx, int yy ) {
          this.xx = xx;
          this.yy = yy;
      }
  }
  
  
  class sortY implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.yy > p2.yy) {
              return -1;
          } else if (p1.yy == p2.yy) {
              if (p1.xx > p2.xx) {
                  return 1;
              } else if (p1.xx < p2.xx) {
                  return -1;
              }
              return 0;
  
          }
          return 1;
      }
  }
  
  class sortX implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.xx > p2.xx) {
              return 1;
          } else if (p1.xx == p2.xx) {
              if (p1.yy > p2.yy) {
                  return 1;
              } else if (p1.yy < p2.yy) {
                  return -1;
              }
              return 0;
  
          }
          return -1;
      }
  }
  
  class debug {
  
      static void print1d(long[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.print(arr[i] + " ");
          }
  
      }
  
      static void print1d(int[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.print(arr[i] + " ");
          }
  
      }
  
      static void print1d(boolean[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.println(i + "= " + arr[i] + " ");
          }
  
      }
  
      static void print2d(int[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
  
      static void print2d(long[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
       static void printPair(ArrayList<pair> list) {
          if(list.size()==0){
              System.out.println("empty list");
              return;
          }
         System.out.println();
         for(int i=0;i<list.size();i++){
            System.out.println(list.get(i).xx+"-"+list.get(i).yy);
         }
      }
  
  }
  
  class Reader {
      final private int BUFFER_SIZE = 1 << 16;
      private DataInputStream din;
      private byte[] buffer;
      private int bufferPointer, bytesRead;
  
      public Reader() {
          din = new DataInputStream(System.in);
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public Reader(String file_name) throws IOException {
          din = new DataInputStream(new FileInputStream(file_name));
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public String readLine() throws IOException {
          byte[] buf = new byte[64]; // line length
          int cnt = 0, c;
          while ((c = read()) != -1) {
              if (c == '\n') {
                  if (cnt != 0) {
                      break;
                  } else {
                      continue;
                  }
              }
              buf[cnt++] = (byte) c;
          }
          return new String(buf, 0, cnt);
      }
  
      public int nextInt() throws IOException {
          int ret = 0;
          byte c = read();
          while (c <= ' ') {
              c = read();
          }
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (neg)
              return -ret;
          return ret;
      }
  
      public long nextLong() throws IOException {
          long ret = 0;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
          if (neg)
              return -ret;
          return ret;
      }
  
      public double nextDouble() throws IOException {
          double ret = 0, div = 1;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
  
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (c == '.') {
              while ((c = read()) >= '0' && c <= '9') {
                  ret += (c - '0') / (div *= 10);
              }
          }
  
          if (neg)
              return -ret;
          return ret;
      }
  
      private void fillBuffer() throws IOException {
          bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
          if (bytesRead == -1)
              buffer[0] = -1;
      }
  
      private byte read() throws IOException {
          if (bufferPointer == bytesRead)
              fillBuffer();
          return buffer[bufferPointer++];
      }
  
      public void close() throws IOException {
          if (din == null)
              return;
          din.close();
      }
  }
    class MultiTreeSet<E> {
  	TreeMap<E, Integer> freqTreeMap = new TreeMap<E, Integer>();
  	int size;
   
  	public MultiTreeSet() {}
   
  	public MultiTreeSet(Collection<? extends E> c) {
  		for(E element : c)
  			add(element);
  	}
   
  	public int size() {
  		return size;
  	}
   
  	public void add(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			freqTreeMap.put(element, 1);
  		else
  			freqTreeMap.put(element,freq+1);
  		++size;
  	}
   
  	public void remove(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq!=null) {
  			if(freq==1)
  				freqTreeMap.remove(element);
  			else
  				freqTreeMap.put(element, freq-1);
  			--size;
  		}
  	}
   
  	public int get(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			return 0;
  		return freq;
  	}
   
  	public boolean contains(E element) {
  		return get(element)>0;
  	}
   
  	public boolean isEmpty() {
  		return size==0;
  	}
   
  	public E first() {
  		return freqTreeMap.firstKey();
  	}
   
  	public E last() {
  		return freqTreeMap.lastKey();
  	}
   
  	public E ceiling(E element) {
  		return freqTreeMap.ceilingKey(element);
  	}
   
  	public E floor(E element) {
  		return freqTreeMap.floorKey(element);
  	}
   
  	public E higher(E element) {
  		return freqTreeMap.higherKey(element);
  	}
   
  	public E lower(E element) {
  		return freqTreeMap.lowerKey(element);
  	}
  }
  