# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include<time.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
#include<fstream>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 924844033; //924844033 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
struct Fll { LL first, second, third, fourth; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Rrep(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum, ans, dp,a[210000],b[200000];
string str, ss;
bool f;
char c;
int di[4][2] = { { 0,1 },{ 1,0 },{ 0,-1 },{ -1,0 } };
struct Edge { LL to, cost; };
struct edge { LL from, to, cost; };
vector<LL>vec;
vector<edge>ed;
vector<LL>v[210000];
map<LL,LL>ma;
set<LL>st;
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}

namespace NTT {
	LL MOD = 924844033;
	LL modpow(LL a, LL n = MOD - 2) {
		LL r = 1;
		while (n) r = r * ((n % 2) ? a : 1) % MOD, a = a * a%MOD, n >>= 1;
		return r;
	}
	vector<LL> fft(vector<LL> v, bool rev = false) {
		int n = v.size(), i, j, m;
		for (i = 0, j = 1; j < n - 1; j++) {
			for (int k = n >> 1; k > (i ^= k); k >>= 1);
			if (i > j) swap(v[i], v[j]);
		}
		for (int m = 2; m <= n; m *= 2) {
			LL wn = modpow(5, (MOD - 1) / m);
			if (rev) wn = modpow(wn);
			for (i = 0; i < n; i += m) {
				LL w = 1;
				for (int j1 = i, j2 = i + m / 2; j2 < i + m; j1++, j2++) {
					LL t1 = v[j1], t2 = w * v[j2] % MOD;
					v[j1] = t1 + t2;
					v[j2] = t1 + MOD - t2;
					while (v[j1] >= MOD) v[j1] -= MOD;
					while (v[j2] >= MOD) v[j2] -= MOD;
					w = w * wn%MOD;
				}
			}
		}
		if (rev) {
			LL rv = modpow(n);
			rep(i, n) v[i] = v[i] * rv%MOD;
		}
		return v;
	}

	vector<LL> MultPoly(vector<LL> P, vector<LL> Q, bool resize = false) {
		if (resize) {
			int maxind = 0, pi = 0, qi = 0, i;
			int s = 2;
			rep(i, P.size()) if (norm(P[i])) pi = i;
			rep(i, Q.size()) if (norm(Q[i])) qi = i;
			maxind = pi + qi + 1;
			while (s * 2 < maxind) s *= 2;
			P.resize(s * 2); Q.resize(s * 2);
		}
		P = fft(P), Q = fft(Q);
		for (int i = 0; i < P.size(); i++) P[i] = P[i] * Q[i] % MOD;
		return fft(P, true);
	}

};
struct Combination {
	int mod;
	vector< int64_t > mfact, rfact;

	Combination(int sz, int mod) : mfact(sz + 1), rfact(sz + 1), mod(mod) {
		mfact[0] = 1;
		for (int i = 1; i < mfact.size(); i++) {
			mfact[i] = mfact[i - 1] * i % mod;
		}
		rfact[sz] = inv(mfact[sz]);
		for (int i = sz - 1; i >= 0; i--) {
			rfact[i] = rfact[i + 1] * (i + 1) % mod;
		}
	}

	int64_t fact(int k) const {
		return (mfact[k]);
	}

	int64_t pow(int64_t x, int64_t n) const {
		int64_t ret = 1;
		while (n > 0) {
			if (n & 1) (ret *= x) %= mod;
			(x *= x) %= mod;
			n >>= 1;
		}
		return (ret);
	}

	int64_t inv(int64_t x) const {
		return (pow(x, mod - 2));
	}

	int64_t P(int n, int r) const {
		if (r < 0 || n < r) return (0);
		return (mfact[n] * rfact[n - r] % mod);
	}

	int64_t C(int p, int q) const {
		if (q < 0 || p < q) return (0);
		return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
	}

	int64_t H(int n, int r) const {
		if (n < 0 || r < 0) return (0);
		return (r == 0 ? 1 : C(n + r - 1, r));
	}
};
Combination comb(210000, MOD);
LL dfs(LL cur,LL par) {
	LL ret = 1;
	rep(i, v[cur].size()) {
		if (v[cur][i] == par)continue;
		LL x = dfs(v[cur][i], cur);
		ret += x;
	}
	if (ret != n) {
		a[n - ret]++;
		a[ret]++;
	}
	return ret;
}
int main() {
	cin >> n;
	rep(i, n-1) {
		LL x, y;
		cin >> x >> y;
		x--, y--;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	dfs(0, -1);
	vector<LL>A, B;
	for (int i = 0; i <= n;i++) {
		A.push_back(a[i] * comb.mfact[i] % MOD);
		B.push_back(comb.rfact[n-i]);
	}
	vector<LL>C = NTT::MultPoly(A, B, 1);
	for (int i = 1; i < n; i++) {
		cout << ((n*comb.C(n, i) % MOD) - ((C[i+n] * comb.rfact[i]) % MOD) + MOD) % MOD << endl;
	}
	cout << n << endl;
	return 0;
}

Measured memory_bytes: 44092