#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 924844033;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

struct FMT {
	const int num_factor = 3;
	ll factor[3] = {2, 3, 7};
	ll gen = 5;

	ll mod_pow(ll a, ll n) {
		if(n == 0) return 1;
		ll res = mod_pow(a, n / 2);
		if(n % 2 == 0) return res * res % mod;
		else return a * res % mod * res % mod;
	}

	bool check() {
		rep(i, 0, num_factor) {
			if(mod_pow(gen, (mod - 1) / factor[i]) == 1) {
				return false;
			}
		}
		return true;
	}
	void fmt(vector<ll>& v, bool rev = false) { //v.size() == (1 << x)
		int n = sz(v), i, j;
		for(i = 0, j = 1; j < n - 1; j++) {
			for(int k = n >> 1; k > (i ^= k); k /= 2);
			if(i > j) swap(v[i], v[j]);
		}
		for(int m = 2; m <= n; m *= 2) {
			ll root = mod_pow(gen, (mod - 1) / m);
			for(int i = 0; i < n; i += m) {
				ll w = 1;
				rep(j, 0, m / 2) {
					ll f0 = v[i + j], f1 = w * v[i + j + m / 2] % mod;
					v[i + j] = (f0 + f1) % mod;
					v[i + j + m / 2] = (mod + f0 - f1) % mod;
					MUL(w, root);
				}
			}
		}
		if(rev) rep(i, 0, n) MUL(v[i], mod_pow(n, mod - 2));
	}
	vector<ll> get(const vector<ll>& A, const vector<ll>& B) {
		int n = 1;
		int len = sz(A) + sz(B) - 1;
		while(n < len) n *= 2;
		vector<ll> a(n, 0), b(n, 0);
		rep(i, 0, sz(A)) a[i] = A[i];
		rep(i, 0, sz(B)) b[i] = B[i];
		fmt(a); fmt(b);
		rep(i, 0, n) MUL(a[i], b[i]);
		reverse(++a.begin(), a.end());
		fmt(a, true);
		vector<ll> res(len);
		rep(i, 0, len) res[i] = a[i];
		return res;
	}
};

ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i))

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

ll invf(ll a) {
	return mod_pow(a, mod - 2);
}

void C_init(int n) {
	fac[0] = fac[1] = 1; inv[1] = 1;
	fiv[0] = fiv[1] = 1;
	rep(i, 2, n + 1) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		fiv[i] = fiv[i - 1] * inv[i] % mod;
	}
}

ll C(int a, int b) { //assume a >= b
	if(a < b || a < 0 || b < 0) return 0;
	return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}

int N;
vi G[MAX_N];
int cnt[MAX_N];

int dfs(int v, int p = -1) {
	int res = 1;
	rep(i, 0, sz(G[v])) {
		int n = G[v][i];
		if(n == p) continue;
		res += dfs(n, v);
	}
	if(p != -1) {
		cnt[res]++;
		cnt[N - res]++;
	}
	return res;
}

void solve() {
	cin >> N;
	C_init(N + 10);
	rep(i, 0, N - 1) {
		int a, b;
		cin >> a >> b; a--; b--;
		G[a].pb(b);
		G[b].pb(a);
	}
	dfs(0);
	
	vector<ll> D(N + 1), E(N + 1);
	rep(i, 0, N + 1) {
		D[i] = cnt[N - i] * fac[N - i] % mod;
		E[i] = fiv[i];
	}
	FMT f;
	vector<ll> F = f.get(D, E);
	vector<ll> ans(N + 1);
	rep(i, 0, N) {
		ans[N - i] = (mod + N * C(N, i) % mod - fiv[N - i] * F[i] % mod) % mod;
	}
	rep(i, 1, N + 1) cout << ans[i] << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 44416