Aristocracy

import math

n = int(input())

m = {}
for _ in range(0, n):
    s = input()
    v = s.split()
    k = v[0]
    if k in m:
        m[k]+=1
    else:
        m[k]=1 


v = list(m.values())
#v.sort(reverse=True)

r = n


MOD = 10**9+7

c = 1
m = v[0]
for i in range(1, len(v)):

    for j in range(0, v[i]):
      m = (m + 1)# % MOD
      c = ((c * m ) ) // (j+1)
      #c = c % MOD
    c = c % MOD
print(c % MOD)

#rtn = math.factorial(n)  % (10**9+7)

#for _, x in m.items():
#    rtn = rtn / (math.factorial(x)  % (10**9+7))

#print(1e9+7)
#print(10**9+7)


#print(int(rtn % (10**9+7)))

#print(str(math.factorial(10**5)))
#print(math.factorial(10**5)% (10**9+7))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED