#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000000LL


struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
combi C(1000000);
mint dfs(int cv,int pv,vector<vector<int>> &E){
	int cnt = 0;
	mint ret = 1;
	rep(i,E[cv].size()){
		int nv = E[cv][i];
		if(nv==pv)continue;
		cnt++;
		ret *= dfs(nv,cv,E);
	}
	mint sum = C.kaijou[cnt];
	if(cv!=0)sum *= cnt+1;
	return ret * sum;
}

int main(){
	int n;
	cin>>n;
	vector<vector<int>> E(n);
	rep(i,n-1){
		int a,b;
		cin>>a>>b;
		a--;b--;
		E[a].push_back(b);
		E[b].push_back(a);
	}
	mint ans = dfs(0,-1,E);
	rep(i,n-1)ans /= i+1;
	cout<<ans.val()<<endl;
	
	return 0;
}