#include <stdio.h>

const int Mod = 998244353;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

typedef struct Edge {
	struct Edge *next;
	int v;
} edge;

int main()
{
	int i, N, M, u, w;
	edge *adj[200001] = {}, e[400001], *p;
	scanf("%d", &N);
	for (i = 0; i < N - 1; i++) {
		scanf("%d %d", &u, &w);
		e[i*2].v = w;
		e[i*2+1].v = u;
		e[i*2].next = adj[u];
		e[i*2+1].next = adj[w];
		adj[u] = &(e[i*2]);
		adj[w] = &(e[i*2+1]);
	}
	
	int par[200001] = {}, deg[200001] = {}, q[200001], head, tail;
	par[1] = 1;
	q[0] = 1;
	for (head = 0, tail = 1; head < tail; head++) {
		u = q[head];
		for (p = adj[u]; p != NULL; p = p->next) {
			w = p->v;
			if (par[w] == 0) {
				par[w] = u;
				deg[u]++;
				q[tail++] = w;
			}
		}
	}
	
	long long tmp = 1;
	while (N > 1) tmp = tmp * (--N) % Mod;
	tmp = div_mod(1, tmp, Mod);
	for (head--; head >= 0; head--) {
		u = q[head];
		for (p = adj[u], i = 0; p != NULL; p = p->next) {
			w = p->v;
			if (w == par[u]) continue;
			tmp = tmp * (i + 1) % Mod * (deg[w] + 1) % Mod;
			i++;
		}
	}
	printf("%lld\n", tmp);
	fflush(stdout);
	return 0;
}