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 enum
  import random
  import collections
  import string
  import math
  import copy
  import os
  import sys
  from io import BytesIO, IOBase
  
  BUFSIZE = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  
  
  def input(): return sys.stdin.readline().rstrip("\r\n")
  
  
  # mo = 998244353
  mo = int(1e9+7)
  
  
  def exgcd(a, b):
      if not b:
          return 1, 0
      y, x = exgcd(b, a % b)
      y -= a//b * x
      return x, y
  
  
  def getinv(a, m):
      x, y = exgcd(a, m)
      return -1 if x == 1 else x % m
  
  
  def comb(n, b):
      res = 1
      b = min(b, n-b)
      for i in range(b):
          res = res*(n-i)/(i+1)
          # res %= mo
      return res
  
  
  def quickpower(a, n):
      res = 1
      while n:
          if n & 1:
              res = res * a % mo
          n >>= 1
          a = a*a % mo
      return res
  
  
  def dis(a, b):
      return abs(a[0]-b[0]) + abs(a[1]-b[1])
  
  
  def getpref(x):
      if x > 1:
          return (x)*(x-1) >> 1
      else:
          return 0
  
  
  def orafli(upp):
      primes = []
      marked = [False for i in range(upp+3)]
      prvs = [i for i in range(upp+3)]
      for i in range(2, upp):
          if not marked[i]:
              primes.append(i)
          for j in primes:
              if i*j >= upp:
                  break
              marked[i*j] = True
              prvs[i*j] = j
              if i % j == 0:
                  break
      return primes, prvs
  
  
  def lower_ord(c: str) -> int:
      return ord(c)-97
  
  
  def upper_ord(c: str) -> int:
      return ord(c) - 65
  
  
  def read_list():
      return [int(i) for i in input().split()]
  
  
  def read_int():
      s = input().split()
      if len(s) == 1:
          return int(s[0])
      else:
          return map(int, s)
  
  
  def ask(s, i, j):
      print(f"{s} {i} {j}", flush=True)
  
  
  def answer(x):
      print(f"finish {x}", flush=True)
  
  import functools
  
  # primes, prvs = orafli(100010)
  
  import itertools
  from fractions import Fraction
  
  import random
  # A = list(map(list,(zip(*A))))
  
  
  def lowbit(x):
      return -x&x
  
  def pref(x):
      return x*(x+1)>>1
  
  def cum(sx, mx):
      return (sx+mx)*(mx-sx+1)>>1
  
  
  
  def solve():
      n = read_int()
      E = []
      D1 = {}
      D2 = {}
      for i in range(n):
          x, y = read_int()
          D1.setdefault(x, []).append(y)
          D2.setdefault(y, []).append(x)
          E.append((x, y))
      ans = n*(n-1)*(n-2)//3//2 
      dans = 0
      for x, y in E:
          dans+=(len(D1[x])-1)*(len(D2[y])-1)
      # print(dans)
      print(ans-dans)
  
  
              
  
  
      
  # fi = open('C:\\cppHeaders\\CF2020.12.17\\test.data', 'r')
  # def input(): return fi.readline().rstrip("\r\n")
  # primes, prv = orafli(10001)
  # solve()
  T = int(input())
  # T = 1
  
  
  
  for ti in range(T):
      solve()
      # except:
          # traceback.print_exc()
  
  
  """
  1
  3 5 1
  *...*
  .***.
  .**..
  """