// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int P = 924844033;

const int N = 200000 + 5;

const int MAX = 524288 + 5;



int n;



vector <int> G[N];

int siz[N];



int f1[MAX];

int f2[MAX];



int a[N];



int fac[N];

int inv[N];



void dfs(int u, int fa) {

  siz[u] = 1;

  for (int i = 0; i < (int) G[u].size(); ++i) {

    int v = G[u][i];

    if (v == fa) {

      continue;

    }

    dfs(v, u);

    --a[siz[v]];

    siz[u] += siz[v];

  }

  --a[n - siz[u]];

}



int lim;

int bit;



int rev(int x) {

  int ret = 0;

  for (int i = 0; i < bit; ++i) {

    ret <<= 1;

    ret |= x & 1;

    x >>= 1;

  }

  return ret;

}



int revbit[MAX];

int g[MAX];



void fft(int *f, int bit, int o) {

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

    if (revbit[i] > i) {

      swap(f[revbit[i]], f[i]);

    }

  }

  for (int i = 0; i < bit; ++i) {

    int len = 1 << i;

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

      int wn = 0;

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

        int t = (long long) f[k + len] * g[wn] % P;

        f[k + len] = (f[k] - t) % P;

        if (f[k + len] < 0) {

          f[k + len] += P;

        }

        f[k] = (f[k] + t) % P;

        wn += o * (1 << bit - i - 1);                        

        if (wn < 0) {

          wn += lim;

        }

      }

    }

  }

}



int modexp(int a, int x, int P) {

  int ret = 1;

  while (x) {

    if (x & 1) {

      ret = (long long) ret * a % P;

    }

    a = (long long) a * a % P;

    x >>= 1;

  }

  return ret;

}



void calc() {

  while ((1 << bit) < n + n) {

    ++bit;   

  }

  lim = 1 << bit;

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

    revbit[i] = rev(i);

  }

  g[0] = 1;

  g[1] = modexp(5, (P - 1) / lim, P);

  for (int i = 2; i < lim; ++i) {

    g[i] = (long long) g[i - 1] * g[1] % P;

  }

  fft(f1, bit, 1);

  fft(f2, bit, 1);

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

    f1[i] = (long long) f1[i] * f2[i] % P;

  }

  fft(f1, bit, -1);

  int invlim = modexp(lim, P - 2, P);

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

    f1[i] = (long long) f1[i] * invlim % P;

  }    

}



int main() {

  scanf("%d", &n);

  for (int i = 0, u, v; i < n - 1; ++i) {

    scanf("%d %d", &u, &v);

    --v;

    --u;

    G[u].push_back(v);

    G[v].push_back(u);

  }

  dfs(0, -1);

  a[n] = n;

  fac[0] = 1;

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

    fac[i] = (long long) fac[i - 1] * i % P;

  }

  inv[n] = modexp(fac[n], P - 2, P);

  for (int i = n - 1; i >= 0; --i) {

    inv[i] = (long long) inv[i + 1] * (i + 1) % P;

  }

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

    f1[n - i] = (long long) a[i] * fac[i] % P;

  }

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

    f2[i] = inv[i];

  }

  calc();

  for (int i = n - 1; i >= 0; --i) {

    printf("%lld\n", (long long) f1[i] * inv[n - i] % P);

  }                  

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.50338101265677x):
#include<bits/stdc++.h>

#define re register

#define inc(i,j,k) for(re int i=j;i<=k;i++)

#define edge(u) for(re int i=head[u];i;i=e[i].nxt)

#define ll long long

using namespace std;

const int mod=924844033;

const int N=8e5+5;

inline int read(){

	int x=0;

	char ch=getchar();

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

	while('0'<=ch&&ch<='9') x=x*10+ch-'0',ch=getchar();

	return x;

}

int n,lim=1,l,r[N],head[N],num[N],sz[N],cnt;

struct edge{

	int to,nxt;

}e[N];

void add(int a,int b){

	e[++cnt].to=b;

	e[cnt].nxt=head[a];

	head[a]=cnt;

}

ll ans[N],fac[N],inv[N],f[N],g[N];

ll c(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}

ll qp(ll x,ll k){

	ll res=1;

	while(k){

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

		k>>=1,x=x*x%mod;

	}

	return res;

}

void ntt(ll *tmp,int tp){

	inc(i,0,lim-1) if(i<r[i]) swap(tmp[i],tmp[r[i]]);

	for(re int mid=1;mid<lim;mid<<=1){

		ll gn=qp(5,(mod-1)/(mid<<1));

		if(tp==-1) gn=qp(gn,mod-2);

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

			ll g=1;

			inc(j,0,mid-1){

				ll x=tmp[i+j],y=g*tmp[i+j+mid]%mod;

				tmp[i+j]=(x+y)%mod;

				tmp[i+j+mid]=(x-y+mod)%mod;

				g=g*gn%mod;

			}

		}

	}

	if(tp==-1){

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

		inc(i,0,lim-1) tmp[i]=tmp[i]*inv%mod;

	}

}

void init(){

	n=read();

	inc(i,2,n){

		int a=read(),b=read();

		add(a,b),add(b,a);

	}

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

	inc(i,1,n) fac[i]=fac[i-1]*i%mod;

	inc(i,2,n) inv[i]=(mod-mod/i)*inv[mod%i]%mod;

	inc(i,3,n) inv[i]=inv[i-1]*inv[i]%mod;

}

void dfs(int u,int f){

	sz[u]=1;

	edge(u){

		int v=e[i].to;

		if(v==f) continue;

		dfs(v,u);

		sz[u]+=sz[v];	

	}

	if(u!=1){

		num[sz[u]]++;

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

	} 

}

int main(){

	init();dfs(1,0);

	inc(i,1,n) g[i]=inv[n-i];

	inc(i,1,n) f[i]=num[i]*fac[i]%mod;

	inc(i,1,n) ans[i]=n*c(n,i)%mod;

	while(lim<=2*n) lim<<=1,l++;

	inc(i,0,lim-1) r[i]=(r[i>>1]>>1)|((i&1)<<(l-1));

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

	inc(i,0,lim-1) f[i]=f[i]*g[i]%mod;

	ntt(f,-1);

	inc(i,1,n) (ans[i]+=mod-inv[i]*f[i+n]%mod)%=mod;

	inc(i,1,n) printf("%lld\n",ans[i]);	

}

/*

3

1 2

2 3

*/