// 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.8117241813006542x):
#include<bits/stdc++.h>

#define maxn 800010

#define P 924844033

#define G 5

using namespace std;

typedef long long ll;

template<typename T> inline void read(T &x)

{

    x=0;char c=getchar();bool flag=false;

    while(!isdigit(c)){if(c=='-')flag=true;c=getchar();}

    while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}

    if(flag)x=-x;

}

ll n;

ll rev[maxn],f[maxn],g[maxn],fac[maxn],ifac[maxn],siz[maxn],cnt[maxn];

struct edge

{

    int to,nxt;

}e[maxn];

int head[maxn],edge_cnt;

void add(int from,int to)

{

    e[++edge_cnt]={to,head[from]},head[from]=edge_cnt;

}

ll qp(ll x,ll y)

{

    ll v=1;

    while(y)

    {

        if(y&1) v=v*x%P;

        x=x*x%P,y>>=1;

    }

    return v;

}

int calc(int n)

{

    int lim=1;

    while(lim<=n) lim<<=1;

    for(int i=0;i<lim;++i)

        rev[i]=(rev[i>>1]>>1)|((i&1)?lim>>1:0);

    return lim;

}

void NTT(ll *a,int lim,int type)

{

    for(int i=0;i<lim;++i)

        if(i<rev[i])

            swap(a[i],a[rev[i]]);

    for(int len=1;len<lim;len<<=1)

    {

        ll wn=qp(G,(P-1)/(len<<1));

        for(int i=0;i<lim;i+=len<<1)

        {

            ll w=1;

            for(int j=i;j<i+len;++j,w=w*wn%P)

            {

                ll x=a[j],y=w*a[j+len]%P;

                a[j]=(x+y)%P,a[j+len]=(x-y+P)%P;

            }

        }

    }

    if(type==1) return;

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

    for(int i=0;i<lim;++i) a[i]=a[i]*inv%P;

    reverse(a+1,a+lim);

}

void mul(ll *f,ll *g)

{

    int lim=calc(n<<1);

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

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

    NTT(f,lim,-1);

}

void dfs(int x,int fa)

{

    siz[x]=1;

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

    {

        int y=e[i].to;

        if(y==fa) continue;

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

    }

    cnt[siz[x]]++,cnt[n-siz[x]]++;

}

ll C(ll n,ll m)

{

    return fac[n]*ifac[m]%P*ifac[n-m]%P;

}

void init()

{

    fac[0]=ifac[0]=1;

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

    ifac[n]=qp(fac[n],P-2);

    for(int i=n-1;i;--i) ifac[i]=ifac[i+1]*(i+1)%P;

}

int main()

{

    read(n),init();

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

    {

        int x,y;

        read(x),read(y);

        add(x,y),add(y,x);

    }

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

    for(int i=1;i<=n;++i) f[i]=cnt[n-i]*fac[n-i]%P,g[i]=ifac[i];

    mul(f,g),reverse(f,f+n+1);

    for(int i=1;i<=n;++i) printf("%lld\n",(n*C(n,i)%P-ifac[i]*f[i]%P+P)%P);

    return 0;

}