// Slower C++ solution:
#include <iostream> 

#include <cstdio> 

#include <cstdlib> 

#include <cstring> 

#include <cmath> 

#include <algorithm> 

using namespace std; 

inline int gi() {

    register int data = 0, w = 1;

    register char ch = 0;

    while (!isdigit(ch) && ch != '-') ch = getchar(); 

    if (ch == '-') w = -1, ch = getchar(); 

    while (isdigit(ch)) data = 10 * data + ch - '0', ch = getchar(); 

    return w * data; 

} 

const int Mod = 924844033, G = 5; 

int fpow(int x, int y) { 

	int res = 1; 

	while (y) { 

		if (y & 1) res = 1ll * res * x % Mod; 

		x = 1ll * x * x % Mod; 

		y >>= 1; 

	} 

	return res; 

} 

const int iG = fpow(G, Mod - 2); 

const int MAX_N = 2e5 + 5; 

int Limit, rev[MAX_N << 2]; 

void FFT_prepare(int len) { 

	int p = 0; 

	for (Limit = 1; Limit <= len; Limit <<= 1) ++p; 

	for (int i = 1; i < Limit; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (p - 1)); 

} 

void NTT(int *p, int op) { 

	for (int i = 1; i < Limit; i++) if (i < rev[i]) swap(p[i], p[rev[i]]); 

	for (int i = 1; i < Limit; i <<= 1) { 

		int rot = fpow(op == 1 ? G : iG, (Mod - 1) / (i << 1)); 

		for (int j = 0; j < Limit; j += i << 1) 

			for (int k = 0, w = 1; k < i; k++, w = 1ll * w * rot % Mod) { 

				int x = p[j + k], y = 1ll * w * p[i + j + k] % Mod; 

				p[j + k] = (x + y) % Mod, p[i + j + k] = (x - y + Mod) % Mod; 

			} 

	} 

	if (!op) { 

		int inv = fpow(Limit, Mod - 2); 

		for (int i = 0; i < Limit; i++) p[i] = 1ll * p[i] * inv % Mod; 

	} 

} 

struct Graph { int to, next; } e[MAX_N << 1]; 

int fir[MAX_N], e_cnt; 

void clearGraph() { memset(fir, -1, sizeof(fir)); e_cnt = 0; } 

void Add_Edge(int u, int v) { e[e_cnt] = (Graph){v, fir[u]}, fir[u] = e_cnt++; } 

int N, f[MAX_N << 2], g[MAX_N << 2], h[MAX_N << 2];

int siz[MAX_N], cnt[MAX_N]; 

void dfs(int x, int fa) { 

	siz[x] = 1; 

	for (int i = fir[x]; ~i; i = e[i].next) {

		int v = e[i].to; if (v == fa) continue; 

		dfs(v, x), siz[x] += siz[v]; 

		cnt[siz[v]]++; 

	} 

	cnt[N - siz[x]]++; 

} 

int fac[MAX_N], ifc[MAX_N]; 

int C(int n, int m) { 

	if (n < 0 || m < 0 || n < m) return 0; 

	else return 1ll * fac[n] * ifc[n - m] % Mod * ifc[m] % Mod; 

} 

int main () { 

	clearGraph(); 

	N = gi(); 

	for (int i = 1; i < N; i++) { 

		int u = gi(), v = gi(); 

		Add_Edge(u, v), Add_Edge(v, u); 

	} 

	fac[0] = 1; for (int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % Mod; 

	ifc[N] = fpow(fac[N], Mod - 2); 

	for (int i = N - 1; ~i; i--) ifc[i] = 1ll * ifc[i + 1] * (i + 1) % Mod;

	dfs(1, 0); 

	for (int i = 1; i <= N; i++) g[i] = 1ll * cnt[i] * fac[i] % Mod; 

	for (int i = 0; i <= N; i++) h[i] = ifc[i]; 

	reverse(&g[0], &g[N + 1]); 

	FFT_prepare(N << 1); 

	NTT(g, 1), NTT(h, 1); 

	for (int i = 0; i < Limit; i++) f[i] = 1ll * g[i] * h[i] % Mod; 

	NTT(f, 0); 

	for (int i = 1; i <= N; i++) { 

		int ans = 1ll * N * C(N, i) % Mod; 

		ans = (ans - 1ll * ifc[i] * f[N - i] % Mod + Mod) % Mod; 

		printf("%d\n", ans); 

	} 

    return 0; 

} 

// Faster C++ solution for the same problem (measured speedup: 1.8123940756057744x):
#include<bits/stdc++.h>

#define re register

#define inc(i,j,k) for(re int i=j;i<=k;i++)

#define edge(u) for(re int i=head[u];i;i=e[i].nxt)

#define ll long long

using namespace std;

const int mod=924844033;

const int N=8e5+5;

inline int read(){

	int x=0;

	char ch=getchar();

	while(ch<'0'||ch>'9') ch=getchar();

	while('0'<=ch&&ch<='9') x=x*10+ch-'0',ch=getchar();

	return x;

}

int n,lim=1,l,r[N],head[N],num[N],sz[N],cnt;

struct edge{

	int to,nxt;

}e[N];

void add(int a,int b){

	e[++cnt].to=b;

	e[cnt].nxt=head[a];

	head[a]=cnt;

}

ll ans[N],fac[N],inv[N],f[N],g[N];

ll c(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}

ll qp(ll x,ll k){

	ll res=1;

	while(k){

		if(k&1) res=res*x%mod;

		k>>=1,x=x*x%mod;

	}

	return res;

}

void ntt(ll *tmp,int tp){

	inc(i,0,lim-1) if(i<r[i]) swap(tmp[i],tmp[r[i]]);

	for(re int mid=1;mid<lim;mid<<=1){

		ll gn=qp(5,(mod-1)/(mid<<1));

		if(tp==-1) gn=qp(gn,mod-2);

		for(re int i=0;i<lim;i+=(mid<<1)){

			ll g=1;

			inc(j,0,mid-1){

				ll x=tmp[i+j],y=g*tmp[i+j+mid]%mod;

				tmp[i+j]=(x+y)%mod;

				tmp[i+j+mid]=(x-y+mod)%mod;

				g=g*gn%mod;

			}

		}

	}

	if(tp==-1){

		ll inv=qp(lim,mod-2);

		inc(i,0,lim-1) tmp[i]=tmp[i]*inv%mod;

	}

}

void init(){

	n=read();

	inc(i,2,n){

		int a=read(),b=read();

		add(a,b),add(b,a);

	}

	fac[0]=inv[0]=inv[1]=1;

	inc(i,1,n) fac[i]=fac[i-1]*i%mod;

	inc(i,2,n) inv[i]=(mod-mod/i)*inv[mod%i]%mod;

	inc(i,3,n) inv[i]=inv[i-1]*inv[i]%mod;

}

void dfs(int u,int f){

	sz[u]=1;

	edge(u){

		int v=e[i].to;

		if(v==f) continue;

		dfs(v,u);

		sz[u]+=sz[v];	

	}

	if(u!=1){

		num[sz[u]]++;

		num[n-sz[u]]++;

	} 

}

int main(){

	init();dfs(1,0);

	inc(i,1,n) g[i]=inv[n-i];

	inc(i,1,n) f[i]=num[i]*fac[i]%mod;

	inc(i,1,n) ans[i]=n*c(n,i)%mod;

	while(lim<=2*n) lim<<=1,l++;

	inc(i,0,lim-1) r[i]=(r[i>>1]>>1)|((i&1)<<(l-1));

	ntt(g,1),ntt(f,1);

	inc(i,0,lim-1) f[i]=f[i]*g[i]%mod;

	ntt(f,-1);

	inc(i,1,n) (ans[i]+=mod-inv[i]*f[i+n]%mod)%=mod;

	inc(i,1,n) printf("%lld\n",ans[i]);	

}

/*

3

1 2

2 3

*/