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

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<vector>

#define ll long long

using namespace std;

const int MAXN=200233;

const int D=924844033,G=5,iG=554906420;

int n,ans[MAXN];

vector<int> ver[MAXN];



int fac[MAXN],inv[MAXN];

int rev[MAXN<<2];

int A[MAXN<<2],B[MAXN<<2];



int qpow(int x,int y) {

	int ret=1;

	while(y) {

		if(y&1) ret=1ll*ret*x%D;

		x=1ll*x*x%D;

		y>>=1;

	}

	return ret;

}



void NTT(int f[],int op,int lim) {

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

		if(rev[i]>i) swap(f[rev[i]],f[i]);

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

		int sta=qpow(~op?G:iG,(D-1)/(i<<1));

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

			int w=1;

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

				int t1=f[j+k],t2=1ll*w*f[i+j+k]%D;

				f[j+k]=(t1+t2)%D;

				f[i+j+k]=(t1-t2+D)%D;

			} 

		}

	}

	if(~op) return ;

	int ilim=qpow(lim,D-2);

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

		f[i]=1ll*f[i]*ilim%D;

}



int siz[MAXN];

void dfs(int u,int fa) {

	siz[u]=1;

	for(int v:ver[u])

		if(v!=fa) dfs(v,u),siz[u]+=siz[v];

}



void first() {

	fac[0]=1;

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

	inv[n]=qpow(fac[n],D-2);

	for(int i=n-1;~i;i--) inv[i]=1ll*inv[i+1]*(i+1)%D;

}

int C(int x,int y) {

	return 1ll*fac[x]*inv[y]%D*inv[x-y]%D;

}



int main() {

	scanf("%d",&n);

	first();

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

		int x,y; scanf("%d%d",&x,&y);

		ver[x].push_back(y);

		ver[y].push_back(x);

	}

	dfs(1,0);

	siz[0]=1;

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

		++A[siz[i]],++A[n-siz[i]];

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

		A[i]=1ll*A[i]*fac[i]%D;

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

		B[i]=inv[i];

	reverse(B,B+n+1);



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

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

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

	NTT(A,1,lim),NTT(B,1,lim);

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

		A[i]=1ll*A[i]*B[i]%D;

	NTT(A,-1,lim);



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

		ans[i]=((1ll*C(n,i)*n-1ll*inv[i]*A[n+i])%D+D)%D;



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

		printf("%d\n",ans[i]);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.525438378085635x):
#include <iostream>

#include <cstdio>

using namespace std;

const int maxn = 2e5 + 50,maxm = 5.3e5,mod = 924844033,g = 5;

int n,x,y,cnt,N,last[maxn],d[maxn],siz[maxn],ifac[maxn],inv[20],W[20],inv_W[20],rev[maxm],F[maxm],G[maxm];

struct edge{

	int v,nxt;

}e[2 * maxn];

int read(){

	int x = 0;

	char c = getchar();

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

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

	return x;

}

inline int add(int x,int y){

	if(x + y < mod) return x + y;

	else return x + y - mod;

}

inline int dec(int x,int y){

	if(x - y >= 0) return x - y;

	else return x - y + mod;

}

int qpow(int x,int k){

	int d = 1,t = x;

	while(k){

		if(k & 1) d = 1ll * d * t % mod;

		t = 1ll * t * t % mod,k >>= 1;

	}

	return d;

}

void NTT_init(int n){

	N = 1;

	int cnt = 0;

	while(N <= n) N <<= 1,cnt ++;

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

}

void NTT(int *F,int n,int p){

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

	int cnt = 1;

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

		int w1 = (p == 1 ? W[cnt] : inv_W[cnt]);

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

			int w = 1;

			for(int k = j; k < j + i; k ++){

				int t1 = F[k],t2 = 1ll * w * F[k + i] % mod;

				F[k] = add(t1,t2),F[k + i] = dec(t1,t2);

				w = 1ll * w * w1 % mod;

			}

		}

		cnt ++;

	}

	if(p == -1) for(int i = 0; i < n; i ++) F[i] = 1ll * F[i] * inv[cnt - 1] % mod;

}

void Mul(int *F,int *G,int n){

	NTT_init(n << 1);

	NTT(F,N,1),NTT(G,N,1);

	for(int i = 0; i < N; i ++) F[i] = 1ll * F[i] * G[i] % mod;

	NTT(F,N,-1);

}

void init(int n){

	NTT_init(n << 1);

	int t = qpow(2,mod - 2);

	inv[0] = 1;

	for(int i = 1; (1 << i) <= N; i ++) inv[i] = 1ll * inv[i - 1] * t % mod;

	for(int i = 1; (1 << i) <= N; i ++) W[i] = qpow(g,(mod - 1) / (1 << i)),inv_W[i] = qpow(W[i],mod - 2);

}

inline void insert(int x,int y){

	cnt ++,e[cnt].v = y,e[cnt].nxt = last[x],last[x] = cnt;

}

void dfs(int u,int fa){

	siz[u] = 1;

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

		int v = e[i].v;

		if(v == fa) continue;

		dfs(v,u);

		siz[u] += siz[v];

	}

	if(u != fa) d[siz[u]] --,d[n - siz[u]] --;

}

int main(){

	n = read();

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

		x = read(),y = read();

		insert(x,y),insert(y,x);

	}

	dfs(1,1);

	d[n] = n;

	init(n);

	int p = 1;

	for(int i = 0; i <= n; i ++) p = 1ll * p * (i ? i : 1) % mod,F[n - i] = 1ll * p * dec(d[i],0) % mod;

	int t = qpow(p,mod - 2); 

	for(int i = n; i >= 0; i --) G[i] = ifac[i] = t,t = 1ll * t * i % mod;

//	for(int i = 0; i <= n; i ++) cout << F[i] << ' ' << G[i] << endl;

	Mul(F,G,n);

	for(int i = 1; i <= n; i ++) printf("%d\n",1ll * ifac[i] * F[n - i] % mod);

	return 0;

}