// 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.8049626733648183x):
#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

*/