output_description: Print the number of pairs of integers i, j (1 \leq i < j \leq N) such that s_i
  is an anagram of s_j.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      s_1
      s_2
      :
      s_N
attempt: N = int(input())
  S = ["".join(sorted(input())) for _ in range(N)]
  D = {}
  count = 0
  for s in S:
      if s in D:
          D[s] = D[s] + 1
      else:
          D[s] = 0
  V = list(D.values())
  print(sum(V))
  
  # #import sys
  # # import math
  #
  # def modc(a, b, m):
  #     c = 1
  #     for i in range(b):
  #         c = c * (a - i) % m
  #         c = c * modinv(i + 1, m) % m
  #     return c
  #
  #
  # def egcd(a, b):
  #     (x, lastx) = (0, 1)
  #     (y, lasty) = (1, 0)
  #     while b != 0:
  #         q = a // b
  #         (a, b) = (b, a % b)
  #         (x, lastx) = (lastx - q * x, x)
  #         (y, lasty) = (lasty - q * y, y)
  #     return (lastx, lasty, a)
  #
  #
  # def modinv(a, m):
  #     (inv, q, gcd_val) = egcd(a, m)
  #     return inv % m
  #
  # N = int(input())
  # #A, B = list(map(int,input().split()))
  # S = [''.join(sorted(input())) for _ in range(N)]
  # D = {}
  # for s in S :
  #     if s in D :
  #         D[s] += 1
  #     else :
  #         D[s] = 1
  # V = list(D.values())
  #
  # count = 0
  # for v in V :
  #     if v == 1 :
  #         count += 0
  #     elif v == 2 :
  #         count += 1
  #     elif v >= 3 :
  #         count += modc(v, 2, 2 ** 63 - 1)
  # print(count)
  
problem_description: Statement
  
  We will call a string obtained by arranging the characters contained in a
  string a in some order, an _anagram_ of a.
  
  For example, `greenbin` is an anagram of `beginner`. As seen here, when the
  same character occurs multiple times, that character must be used that number
  of times.
  
  Given are N strings s_1, s_2, \ldots, s_N. Each of these strings has a length
  of 10 and consists of lowercase English characters. Additionally, all of these
  strings are distinct. Find the number of pairs of integers i, j (1 \leq i < j
  \leq N) such that s_i is an anagram of s_j.
samples: [{"input": "3\n    acornistnt\n    peanutbomb\n    constraint", "output": "1\n    \n\ns_1 = `acornistnt` is an anagram of s_3 = `constraint`. There are no other\npairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\n* * *"}, {"input": "2\n    oneplustwo\n    ninemodsix", "output": "0\n    \n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\n* * *"}, {"input": "5\n    abaaaaaaaa\n    oneplustwo\n    aaaaaaaaba\n    twoplusone\n    aaaabaaaaa", "output": "4\n    \n\nNote that the answer may not fit into a 32-bit integer type, though we cannot\nput such a case here."}]