// 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.8117063630762142x):
#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<iostream>

#include<map>

#include<string>



#define maxn 400005

#define MOD 924844033



using namespace std;



inline int getint()

{

	int num=0,flag=1;char c;

	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;

	while(c>='0'&&c<='9')num=num*10+c-48,c=getchar();

	return num*flag;

}



int n;

int fir[maxn],nxt[maxn],to[maxn],cnt;

int rev[maxn<<2];

int sz[maxn],a[maxn<<2],b[maxn<<2];

int fac[maxn],inv[maxn];



inline void newnode(int u,int v)

{to[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

inline void dfs(int u,int fa)

{

	sz[u]=1;

	for(int i=fir[u];i;i=nxt[i])if(to[i]!=fa)

	{

		dfs(to[i],u),sz[u]+=sz[to[i]];

		a[sz[to[i]]]++;

	}

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

}



inline int ksm(int num,int k)

{

	int ret=1;

	for(;k;k>>=1,num=1ll*num*num%MOD)if(k&1)ret=1ll*ret*num%MOD;

	return ret;

}

inline void getrev(int N)

{for(int i=0;i<N;i++)rev[i]=(rev[i>>1]>>1)|(i&1?N>>1:0);}

inline void NTT(int *a,int opt,int N)

{

	for(int i=0;i<N;i++)if(rev[i]<i)swap(a[i],a[rev[i]]);

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

	{

		int wn=ksm(5,(MOD-1)/(i<<1));

		if(!~opt)wn=ksm(wn,MOD-2);

		for(int j=0;j<N;j+=(i<<1))for(int k=0,w=1;k<i;k++,w=1ll*w*wn%MOD)

		{

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

			a[j+k]=(x+y)%MOD,a[i+j+k]=(x-y+MOD)%MOD;

		}

	}

	if(!~opt)for(int i=0,Inv=ksm(N,MOD-2);i<N;i++)a[i]=1ll*a[i]*Inv%MOD;

}



int main()

{

	n=getint();

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

	{

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

		newnode(u,v),newnode(v,u);

	}

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

	for(int i=2;i<=n;i++)fac[i]=1ll*fac[i-1]*i%MOD;

	for(int i=2;i<=n;i++)inv[i]=1ll*inv[MOD%i]*(MOD-MOD/i)%MOD;

	for(int i=2;i<=n;i++)inv[i]=1ll*inv[i]*inv[i-1]%MOD;

	dfs(1,0);a[0]=0;

	for(int i=0;i<=n;i++)a[i]=1ll*a[i]*fac[i]%MOD;

	for(int i=0;i<=n;i++)b[i]=inv[n-i];

	int len=1;

	while(len<=2*n)len<<=1;

	getrev(len);

	NTT(a,1,len),NTT(b,1,len);

	for(int i=0;i<len;i++)a[i]=1ll*a[i]*b[i]%MOD;

	NTT(a,-1,len);

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

	{

		int ans=1ll*fac[n]*inv[i]%MOD*inv[n-i]%MOD*n%MOD;

		printf("%lld\n",(ans-1ll*a[i+n]*inv[i]%MOD+MOD)%MOD);

	}

}