#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#define ll long long
#define pb push_back
using namespace std;
const int N=200010;
const ll P=924844033;
int n;
vector<int>g[N];
int siz[N];
int rev[N<<2],lim,lev;
ll pwr(int ll x,ll y){
	if(!y)return 1;
	if(y&1)return pwr(x,y-1)*x%P;
	ll z=pwr(x,y/2);
	return z*z%P;
}
inline void ntt(ll *a,int t){
	for(int i=0;i<lim;i++)
		if(i<rev[i])
			swap(a[i],a[rev[i]]);
	for(int mid=1;mid<lim;mid<<=1){
		int rgt=mid<<1;
		ll wn=pwr(5,(P-1)/rgt);
		if(t==-1)wn=pwr(wn,P-2);
		for(int loc=0;loc<lim;loc+=rgt){
			ll w=1;
			for(int k=0;k<mid;k++){
				ll x=a[loc+k],y=w*a[loc+mid+k]%P;
				a[loc+k]=(x+y)%P;
				a[loc+mid+k]=(x-y+P)%P;
				w=w*wn%P;
			}
		}
	}
	if(t==-1){
		ll invlim=pwr(lim,P-2);
		for(int i=0;i<lim;i++)
			a[i]=a[i]*invlim%P;
	}
}
ll a[N<<2],b[N<<2];
ll fac[N],inv[N];
void dfs(int x,int f){
	siz[x]=1;
	int i,k;
	for(i=g[x].size()-1;~i;i--){
		k=g[x][i];
		if(k==f)continue;
		dfs(k,x);
		a[siz[k]]++;
		siz[x]+=siz[k];
	}
	a[n-siz[x]]++;
}
inline void init(){
	fac[0]=1;
	int i;
	for(i=1;i<=n;i++)
		fac[i]=fac[i-1]*i%P;
	inv[n]=pwr(fac[n],P-2);
	for(i=n;i;i--)
		inv[i-1]=inv[i]*i%P;
}
int main(){
	int i;
	scanf("%d",&n);
	for(i=1;i<n;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		g[x].pb(y);
		g[y].pb(x);
	}
	dfs(1,0);
	for(i=1;i<n;i++)
		a[i]=P-a[i];
	a[n]=n;
	init();
	for(i=1;i<=n;i++)
		a[i]=a[i]*fac[i]%P;
	for(i=1;i<=n;i++)
		b[i]=inv[n-i];
	//(i)+(n-(i-k))=(n+k)
	lim=1;
	while(lim<=n*2){
		lim<<=1;
		lev++;
	}
	for(i=0;i<lim;i++)
		rev[i]=(rev[i>>1]>>1)|((i&1)<<(lev-1));
	ntt(a,1);
	ntt(b,1);
	for(i=0;i<lim;i++)
		a[i]=a[i]*b[i]%P;
	ntt(a,-1);
	for(i=1;i<=n;i++)
		printf("%lld\n",a[i+n]*inv[i]%P);
	return 0;
}