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

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

typedef long long lint;

const int N=262144;

const int mod=924844033;

//5

int n,cal[N],fac[N],inv[N];



inline int nxi(){

	int x=0;

	char c;

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

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

	return x;

}



inline int fpow(int x,int t){

	int ans=1;

	for(; t; x=(lint)x*x%mod,t>>=1){

		if(t&1) ans=(lint)ans*x%mod; 

	}

	return ans;

}



inline void init(){

	fac[0]=1;

	for(int i=1; i<N; ++i) fac[i]=(lint)fac[i-1]*i%mod;

	inv[N-1]=fpow(fac[N-1],mod-2);

	for(int i=N-1; i; --i) inv[i-1]=(lint)inv[i]*i%mod;

}



inline int C(const int x,const int y){

	if(x<y) return 0;

	return (lint)fac[x]*inv[y]%mod*inv[x-y]%mod;

}



namespace G{

	int cnt,fir[N],sz[N];

	struct edge{

		int to,nx;

	}eg[N<<1];



	inline void add(const int a,const int b){

		eg[++cnt]=(edge){b,fir[a]};

		fir[a]=cnt;

	}



	inline void dfs_cal(const int x){

		sz[x]=1;

		for(int i=fir[x]; i; i=eg[i].nx){

			const int y=eg[i].to;

			if(!sz[y]){

				dfs_cal(y);

				++cal[sz[y]];

				sz[x]+=sz[y];

			}

		}

		++cal[n-sz[x]];

	}

}



namespace P{



	void ntt(int *a,int len,bool f){

		static int rev[N<<1];

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

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

			if(i<rev[i]) std::swap(a[i],a[rev[i]]);

		}

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

			int t=fpow(5,(mod-1)/(i<<1));

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

				for(int w=1,k=0; k<i; ++k,w=(lint)w*t%mod){

					lint p=(lint)w*a[j+k+i];

					a[j+k+i]=(a[j+k]-p)%mod;

					a[j+k]=(a[j+k]+p)%mod;

				}

			}

		}

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

			if(a[i]<0) a[i]+=mod;

		}

		if(f==0) return;

		std::reverse(a+1,a+len);

		int tmp=fpow(len,mod-2);

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

			a[i]=(lint)a[i]*tmp%mod;

		}

	}



	class poly{

		public:

			int len,*n;

			poly(int len=0){

				this->len=len;

				n=new int[len+1];

			}

			friend poly operator * (poly a,poly b);

	}ans;



	poly operator * (poly a,poly b){

		static int buka[N<<1],bukb[N<<1];

		poly c(a.len+b.len);

		int len=1;

		while(len<=c.len) len<<=1;

		memset(buka,0,len*sizeof(int));

		memset(bukb,0,len*sizeof(int));

		memcpy(buka,a.n,(a.len+1)*sizeof(int));

		memcpy(bukb,b.n,(b.len+1)*sizeof(int));

		ntt(buka,len,0);

		ntt(bukb,len,0);

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

			buka[i]=(lint)buka[i]*bukb[i]%mod;

		}

		ntt(buka,len,1);

		memcpy(c.n,buka,(c.len+1)*sizeof(int));

		return c;

	}



	inline void get_poly(){

		poly a(n),b(n);

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

			a.n[i]=(lint)cal[i]*fac[i]%mod;

			b.n[i]=inv[n-i-1];

		}

		ans=a*b;

	}

}



int main(){

	init();

	n=nxi();

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

		const int a=nxi(),b=nxi();

		G::add(a,b);

		G::add(b,a);

	}

	G::dfs_cal(1);

	P::get_poly();

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

		const int all=(lint)n*C(n,i)%mod;

		const int invld=(lint)inv[i]*P::ans.n[n-1+i]%mod;

		printf("%d\n",(all+mod-invld)%mod);

	}

	return 0;

}


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

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <string>

#include <algorithm>

#define N 601000

typedef long long ll; 

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

  x = 0; char  c = getchar();

  while (!isdigit(c)) c = getchar();

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

}

using namespace std;

const int P = 924844033;

const int G = 5;

int Gi; 

inline ll quickpow(ll x, int k) {

  ll res = 1;

  while (k) {

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

    x = x *x  % P;

    k >>= 1;

  }

  return res;

}

int n;

struct edge{

  int nxt, to; 

}e[N << 1]; 

int head[N], ecnt;

inline void addedge(int from, int to) {

  e[++ecnt] = (edge){head[from], to};

  head[from] = ecnt;

}



int siz[N], dep[N], fa[N];

void dfs_son(int cur, int faa) {

  siz[cur] = 1, fa[cur] = faa;

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

    int to = e[i].to; if (to == faa)  continue;

    dfs_son(to, cur);

    siz[cur] += siz[to];

  }

}



int cnt[N];

ll f[N], g[N], A[N], ans[N];

int limi, L, r[N];

inline void ntt(ll *a, int type) {

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

    if (i < r[i]) swap(a[i], a[r[i]]);

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

    ll T = quickpow(type == 1 ? G : Gi, (P - 1) / (i << 1));

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

      ll t = 1;

      for (int k = 0; k < i; ++k, t = t * T % P) {

        ll nx = a[j + k], ny = t * a[j + k + i] % P;

        a[j + k] = (nx + ny) % P;

        a[j + k + i] = (nx - ny + P) % P;

      }   

    }   

  }

  if (type == -1) {

    ll inv = quickpow(limi, P - 2); 

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

  }

}



ll jie[N], jieni[N];

inline ll get_c(int n, int m) {

  if (n < 0 || m < 0 || n - m < 0)  return 0;

  return jie[n] * jieni[m] % P * jieni[n - m] % P;

}

inline void work() {

  limi = 1;

  while (limi <= n + n + 2) limi <<= 1, ++L;

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

    r[i] = (r[i >> 1] >> 1) | ((i & 1) << (L - 1));

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

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

  ntt(A, -1);

//  for (int i= 0; i <= n; ++i)	printf("A(yuan)[%d] = %lld\n", i, A[n - i]);

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

    ll ans = (1ll * n * get_c(n, k) % P - jieni[k] * A[n - k] % P) % P;

//    printf("%d * %lld - %lld * %lld = \n", n, get_c(n, k), jie[k], A[n - k]);

    printf("%lld\n", (ans % P + P) % P); 

  }

}



inline void init() {

  jie[0] = jieni[0] = 1;

  int up = n + 10; 

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

  jieni[up] = quickpow(jie[up], P - 2); 

  for (int i = up - 1; i; --i)  jieni[i] = jieni[i + 1] * (i + 1) % P;

  Gi = quickpow(G, P - 2); 

}



int main() {

  read(n); init();

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

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

  }

  dfs_son(1, 0); 

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

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

  }

  for (int i = 0; i <= n; ++i)  f[i] = 1ll * cnt[n - i] * jie[n - i] % P;

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

//  for (int i = 0; i <= n; ++i)	printf("f[%d] = %lld, g = %lld\n", i, f[i], g[i]);

  work();

  return 0;

}



/*

3

1 2

2 3

//3 7 3

*/