1172B - Nauuo and Circle - CodeForces Solution

MOD = 998244353

def factorial(n):
    ans = 1
    for i in range(1, n + 1):
        ans = (ans * i) % MOD
    return ans

def main():
    n = int(input())
    children_count = [0] * (n + 1)

        for _ in range(n - 1):
        u, v = map(int, input().split())
        children_count[u] += 1
        children_count[v] += 1

    ans = n
    for i in range(1, n + 1):
        ans = (ans * factorial(children_count[i])) % MOD

    print(ans)

if __name__ == "__main__":
    main()