#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int mod=;

const int M=2e5+;

struct node{

    int nextt,v;

}e[M<<];

vector<int>son[M];

int head[M],n,tot;

ll fac[M],dp[M];

void addedge(int u,int v){

    e[tot].v=v;

    e[tot].nextt=head[u];

    head[u]=tot++;

}

void dfs(int u,int f){

    for(int i=head[u];~i;i=e[i].nextt){

        int v=e[i].v;

        if(v==f)

            continue;

        son[u].push_back(v);

        dfs(v,u);

    }

    int flag=;

    if(u!=)

        flag=;

    int k=son[u].size()+flag;

    dp[u]=fac[k];

    for(int i=;i<son[u].size();i++){

        dp[u]=dp[u]*dp[son[u][i]]%mod;

    }

}

ll solve(){

    dfs(,);

    return dp[]*n%mod;

}

int main(){

    scanf("%d",&n);

    fac[]=;

    for(int i=;i<=n;i++)

        fac[i]=(i*fac[i-])%mod;

    memset(head,-,sizeof(head));

    for(int i=;i<n;i++){

        int u,v;

        scanf("%d%d",&u,&v);

        addedge(u,v);

        addedge(v,u);

    }

    printf("%I64d",solve());

    return ;

}