#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << x << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

constexpr ll mod = 924844033;
vector<ll> fac, inv, facinv;

void modcalc(int modsize) {
	fac.resize(modsize); inv.resize(modsize); facinv.resize(modsize);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < modsize; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		facinv[i] = facinv[i - 1] * inv[i] % mod;
	}
}

ll modinv(ll a) {
	a %= mod;
	if (a == 0) abort();
	if (a < (ll)inv.size()) return inv[a];
	ll b = mod, u = 1, v = 0;
	while (b) {
		ll t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= mod;
	if (u < 0) u += mod;
	return u;
}

ll modpow(ll a, ll b, ll m = mod) {
	ll ans = 1;
	a %= m;
	while (b) {
		if (b & 1) ans = ans * a % m;
		a = a * a % m;
		b >>= 1;
	}
	return ans;
}

ll modcomb(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}

ll modperm(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[n - k] % mod;
}

ll modhom(ll n, ll k) {
	if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod;
}

constexpr ll root = 5;

void ntt(vector<ll> &f, bool inv) {
	int n = f.size();
	if (n == 1) return;
	ll h = modpow(root, (mod - 1) / n);
	if (inv) h = modinv(h);
	vector<ll> a, b;
	for (int i = 0; i < n / 2; i++) {
		a.push_back(f[i << 1]); 
		b.push_back(f[i << 1 | 1]);
	}
	ntt(a, inv); ntt(b, inv);
	ll base = 1; ll t = (n >> 1) - 1;
	for (int i = 0; i < n; i++) {
		f[i] = a[i & t] + base * b[i & t];
		f[i] %= mod;
		base = base * h % mod;
	}
}

vector<ll> convolution(vector<ll> f, vector<ll> g) {
	int n = 1;
	while (n < f.size() + g.size() + 2) n <<= 1;
	f.resize(n); g.resize(n);
	ntt(f, false); ntt(g, false);
	vector<ll> res(n);
	for (int i = 0; i < n; i++) res[i] = f[i] * g[i] % mod;
	ntt(res, true);
	ll inv = modinv(n);
	for (int i = 0; i < n; i++) res[i] = res[i] * inv % mod;
	return res;
}

vector<vector<int>> graph(200010, vector<int>());
vector<int> sz(200010, 1);

void dfs(int n, int p) {
	for (int i : graph[n]) {
		if (i == p) continue;
		dfs(i, n);
		sz[n] += sz[i];
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);
	modcalc(200010);

	ll n;
	cin >> n;
	rep(i, n - 1) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		graph[u].pb(v);
		graph[v].pb(u);
	}
	dfs(n - 1, -1);
	vector<ll> a(n);
	rep(i, n - 1) {
		a[sz[i]] += fac[sz[i]];
		a[n - sz[i]] += fac[n - sz[i]];
	}
	rep(i, n) a[i] %= mod;
	vector<ll> b(n);
	rep(i, n) b[i] = facinv[n - 1 - i];
	vector<ll> c = convolution(a, b);
	for (int k = 1; k <= n; k++) {
		ll ans = n * modcomb(n, k);
		ans -= c[n + k - 1] * facinv[k] % mod;
		ans %= mod;
		if (ans < 0) ans += mod;
		cout << ans << '\n';
	}
}

Measured memory_bytes: 56072