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: from collections import Counter, defaultdict, deque
  import bisect, heapq
  from sys import stdin, stdout
  from itertools import repeat
  import math
  
  
  def inp(force_list=False):
      re = map(int, raw_input().split())
      if len(re) == 1 and not force_list:
          return re[0]
      return re
  
  def inst():
      return raw_input().strip()
  
  def gcd(x, y):
     while(y):
         x, y = y, x % y
     return x
  
  mod = int(1e9+7)
  
  def qmod(a, b):
      res = 1
      while b:
          if b&1:
              res = (res*a)%mod
          b >>= 1
          a = (a*a)%mod
      return res
  
  def inv(a):
      return qmod(a, mod-2)
  
  def C(n, k):
      res = 1
      for i in range(n, n-k, -1):
          res *= i
      for i in range(2, k+1):
          res /= i
      return res
  
  def my_main():
      kase = inp()
      pans = []
      for ka in range(kase):
          n = inp()
          sz = [0 for i in range(n+1)]
          ct = [[] for i in range(n+1)]
          for i in range(n):
              x, y = inp()
              sz[y] += 1
              ct[x].append(y)
          ans = C(n, 3)
          for i in range(1, n+1):
              if len(ct[i]) >= 2:
                  for j in ct[i]:
                      ans -= (sz[j]-1) * (len(ct[i])-1)
  
          pans.append(str(ans))
      print '\n'.join(pans)
  
  my_main()
  