Aristocracy

n = int(input())
m = {}
t = 0
for i in range(n):
    a, b = input().split()
    m.setdefault(a, 0)
    m[a] += 1
    t += 1

md = int(1e9 + 7)

def bn(nn, kk):
    tot = 1
    dn = 1
    for i in range(kk):
        tot *= nn
        tot %= md
        nn -= 1
        dn *= (i+1)
        dn %= md
    return tot // dn

tot = None
out = 1
for i in m.values():
    if not tot:
        tot = i
        continue
    tot += i
    out *= bn(tot, i)
    out %= md


print(out)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED