// Original C++ solution (slower):
#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; 

} 

// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

using namespace std;



inline int read()

{

	int x=0,f=1,c=getchar();

	while(c<48) c=='-'&&(f=-1),c=getchar();

	while(c>47) x=x*10+c-'0',c=getchar();

	return x*f;

}



const int MAXN = 600005;

const int mod = 924844033;

int fac[MAXN],ifac[MAXN],cnt[MAXN],sz[MAXN];

int f[MAXN],g[MAXN],rev[MAXN];

int n;



inline int qpow(int x,int k)

{

	int res=1;

	for(int i=k; i; i>>=1,x=1ll*x*x%mod)

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

	return res;

}



struct edge {int v,nxt;} e[MAXN<<1];

int head[MAXN];

inline void addEdge(int u,int v)

{

	static int c=0;

	e[++c]=(edge) {v,head[u]},head[u]=c;

}





inline void init(int n)

{

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

	ifac[n]=qpow(fac[n],mod-2);

	for(int i=n; i; --i) ifac[i-1]=1ll*ifac[i]*i%mod;

}



inline int C(int n,int m)

{return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}





inline void dfs(int u,int fa)

{

	sz[u]=1;

	for(int i=head[u]; i; i=e[i].nxt)

	{

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

		dfs(v,u),sz[u]+=sz[v],++cnt[sz[v]];

	}

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

}



inline void ntt(int *a,int n,int op)

{

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

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

	{

		int rot=qpow(op==1?5:554906420,(mod-1)/(i<<1));

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

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

			{

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

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

			}

	}

	if(op==-1)

	{

		int inv=qpow(n,mod-2);

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

	}

}



int main()

{

	n=read();

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

	{

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

		addEdge(u,v),addEdge(v,u);

	}

	dfs(1,0); init(n);

	for(int i=1; i<=n; ++i) f[i]=1ll*cnt[i]*fac[i]%mod;

	reverse(f,f+n+1);

	for(int i=0; i<=n; ++i) g[i]=ifac[i];

	int lim=1,l=0;

	for(; lim<=n<<1; lim<<=1,++l);

	for(int i=0; i<lim; ++i) rev[i]=(rev[i>>1]>>1)|((i&1)<<(l-1));

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

	for(int i=0; i<lim; ++i) f[i]=1ll*f[i]*g[i]%mod;

	ntt(f,lim,-1);

	reverse(f,f+n+1);

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

		printf("%lld\n",(1ll*n*C(n,i)%mod

		                 -1ll*ifac[i]*f[i]%mod+mod)%mod);

	return 0;

}

// Fastest known solution for this problem: