#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memset(x,-1,sizeof(x))
#define MEM(x) memset(x,0,sizeof(x))
#define less Less
#define EPS 1e-4
#define arg ARG
#define cpdd const pdd
#define rank Rank
#define KK 500
#define MXN 200005
LL cnt[200005];
int Size[200005];
vector<int> v[200005];
int n;
void dfs(int x,int f){
    Size[x]++;
    for(auto it:v[x]){
        if(it!=f){
            dfs(it,x);
            Size[x]+=Size[it];
        }
    }
    cnt[Size[x]]++;
    cnt[n-Size[x]]++;
}
int P=924844033,root=5,MAXNUM=1<<21;
LL f_pow(unsigned int a,LL b){
    LL res=1,temp=a;
    while(b){
        if(b&1)res=res*temp%P;
        temp=temp*temp%P;
        b>>=1;
    }
    return res;
}
LL fra[200005];
LL invf[200005];
int mod=924844033;
void build(){
    fra[0]=1;
    for(int i = 1;i<200005;i++)
        fra[i]=fra[i-1]*i%mod;
    invf[200000]=f_pow(fra[200000],mod-2);
    for(int i = 199999;i>=0;i--)
        invf[i]=invf[i+1]*(i+1)%mod;
}

// Remember coefficient are mod P
/*
p=a*2^n+1 degree(poly) <= 2^n
n		2^n 				p 					a 		root
16  	65536 			    65537 				1 		3
20 	    1048576		 	    7340033 			7 		3
23                          998244353           119     3          
*/
int bigmod(long long a,int b){
	if(b==0)return 1;
	return (bigmod((a*a)%P,b/2)*(b%2?a:1ll))%P;
}
int inv(int a,int b){
	if(a==1)return 1;
	return (((long long)(a-inv(b%a,a))*b+1)/a)%b;
}
std::vector<long long> ps(MAXNUM);
std::vector<int> rev(MAXNUM);

struct poly{
	std::vector<unsigned int> co;
	int n;//polynomial degree = n
	poly(int d){n=d;co.resize(n+1,0);}
	void ntt(int NN){
		int r=0,st,N;
		unsigned int a,b;
		//while((1<<r)<(NN>>1))++r;//inv:r=0
		//for(N=2;N<=NN;N<<=1,--r){
        for(N=NN;N>1;N>>=1,r++){
			for(st=0;st<NN;st+=N){
				int i,ss=st+(N>>1);
				for(i=(N>>1)-1;i>=0;--i){
					a=co[st+i]; //b=(ps[i<<r]*co[ss+i])%P;
                                b=co[ss+i];
					co[st+i]=a+b; if(co[st+i]>=P)co[st+i]-=P;
					//co[ss+i]=a+P-b; if(co[ss+i]>=P)co[ss+i]-=P;
                    co[ss+i]=((a+P-b)*ps[i<<r])%P;
				}
			}
		}
	}
	void ntt_inv(int NN){
        int r=0,st,N;
		unsigned int a,b;
		while((1<<r)<(NN>>1))++r;//inv:r=0
		for(N=2;N<=NN;N<<=1,--r){
        //inv for(N=NN;N>1;N>>=1,r++)
			for(st=0;st<NN;st+=N){
				int i,ss=st+(N>>1);
				for(i=(N>>1)-1;i>=0;--i){
					a=co[st+i]; b=(ps[i<<r]*co[ss+i])%P;
                                //inv b=co[ss+i];
					co[st+i]=a+b; if(co[st+i]>=P)co[st+i]-=P;
					co[ss+i]=a+P-b; if(co[ss+i]>=P)co[ss+i]-=P;
                    //inv co[ss+i]=((a+P-b)*ps[i<<r])%p;
				}
			}
		}
	}
    poly operator*(const poly& _b)const{
		poly a=*this,b=_b;
		int k=n+b.n,i,N=1;
		while(N<=k)N*=2;
		a.co.resize(N,0); b.co.resize(N,0);
		int r=bigmod(root,(P-1)/N),Ni=inv(N,P);
		ps[0]=1;
		for(i=1;i<N;++i)ps[i]=(ps[i-1]*r)%P;
		a.ntt(N);b.ntt(N);
		for(i=0;i<N;++i)a.co[i]=((long long)a.co[i]*b.co[i])%P;
		r=inv(r,P);
		for(i=1;i<N/2;++i)std::swap(ps[i],ps[N-i]);
		a.ntt_inv(N);
		for(i=0;i<N;++i)a.co[i]=((long long)a.co[i]*Ni)%P;
		a.n=n+_b.n; return a;
	}
};
LL C(int a,int b){
    return fra[a]*invf[b]%mod*invf[a-b]%mod;
}
int main(){
    scanf("%d",&n);
    build();
    for(int i = 1;i<n;i++){
        int x,y;
        scanf("%d %d",&x,&y);
        v[x].pb(y);
        v[y].pb(x);
    }
    dfs(1,0);
    cnt[n]=0;
    for(int i = 1;i<=n;i++){
        
      //  printf("%d ",cnt[i]);
        cnt[i]=cnt[i]*fra[i]%mod;
    }
    poly a(n);
    for(int i = 0;i<=n;i++){
        a.co[i]=cnt[i];
        
    }
    poly b(n);
    for(int i = 0;i<=n;i++)
        b.co[i]=invf[n-i];
    a=a*b;
    for(int i = 1;i<=n;i++){
        LL tot=C(n,i)*n;
    //    printf("%lld\n",(()))
     //   for(auto it:a.co){
        printf("%lld",((tot-invf[i]*a.co[i+n])%mod+mod)%mod);//((tot-fra[i]*it)%mod+mod)%mod);
       // }
        printf("\n");
    }
}
/*

b[i]*K!/(i)!*(K-i)!
*/

Measured memory_bytes: 58228