#include<bits/stdc++.h>

#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x,n) for(long long hoge = 0; (hoge) < (n); ++ (hoge)) cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
const ll INF = LLONG_MAX/2;
const ll MOD = 924844033;

inline ll add(ll a, ll b, ll M) { // a + b (mod M)
    return (a += b) >= M ? a - M : a;
}
inline ll sub(ll a, ll b, ll M) { // a - b (mod M)
    return (a -= b) < 0 ? a + M : a;
}
inline ll mul(ll a, ll b, ll M) { // a * b (mod M)
    ll r = a*b - (ll)((long double)(a)*b/M+.5)*M;
    return r < 0 ? r + M: r;
}
inline ll div(ll a, ll b, ll M) { // solve b x == a (mod M)
    ll u = 1, x = 0, s = b, t = M;
    while (s) { // extgcd for b x + M s = t
        ll q = t / s;
        swap(x -= u * q, u);
        swap(t -= s * q, s);
    }
    if (a % t) return -1; // infeasible
    return mul(x < 0 ? x + M : x, a / t, M); // b (xa/t) == a (mod M)
}
inline ll pow(ll a, ll b, ll M) {
    ll x = 1;
    for (; b > 0; b >>= 1) {
        if (b & 1) x = (a * x) % M;
        a = (a * a) % M;
    }
    return x;
}

// p(x) = p[0] + p[1] x + ... + p[n-1] x^n-1
// assertion: p.back() != 0
typedef vector<ll> poly;
ostream& operator<<(ostream &os, const poly &p) {
    bool head = true;
    for (size_t i = 0; i < p.size(); ++i) {
        if (p[i] == 0) continue;
        if (!head) os << " + ";
        os << p[i];
        head = false;
        if (i >= 1) os << " x";
        if (i >= 2) os << "^" << i;
    }
    return os;
}
inline poly add(poly p, const poly &q, ll M) {
    if (p.size() < q.size()) p.resize(q.size());
    for (size_t i = 0; i < q.size(); ++i)
        p[i] = add(p[i], q[i], M);
    while (!p.empty() && !p.back()) p.pop_back();
    return p;
}
inline poly sub(poly p, const poly &q, ll M) {
    if (p.size() < q.size()) p.resize(q.size());
    for (size_t i = 0; i < q.size(); ++i)
        p[i] = sub(p[i], q[i], M);
    while (!p.empty() && !p.back()) p.pop_back();
    return p;
}



// FFT-based multiplication: this works correctly for M in [int]
// assume: size of a/b is power of two, mod is predetermined
template <int mod,int primitive_root, int sign>
inline void fmt(vector<ll>& x) {
    const int n = x.size();
    int h = pow(primitive_root, (mod-1)/n, mod);
    if (sign < 0) h = div(1, h, mod);
    for (int i = 0, j = 1; j < n-1; ++j) {
        for (int k = n >> 1; k > (i ^= k); k >>= 1);
        if (j < i) swap(x[i], x[j]);
    }
    for (int m = 1; m < n; m *= 2) {
        ll w = 1, wk = pow(h, n / (2*m), mod);
        for (int i = 0; i < m; ++i) {
            for (int s = i; s < n; s += 2*m) {
                ll u = x[s], d = x[s + m] * w % mod;
                if ((x[s] = u + d) >= mod) x[s] -= mod;
                if ((x[s + m] = u - d) < 0) x[s + m] += mod;
            }
            w = w * wk % mod;
        }
    }
    if (sign < 0) {
        ll inv = div(1, n, mod);
        for (auto &a: x)
            a = a * inv % mod;
    }
}
// assume: size of a/b is power of two, mod is predetermined
template <int mod,int primitive_root>
inline vector<ll> conv(vector<ll> a, vector<ll> b){
    fmt<mod,primitive_root,+1>(a); fmt<mod,primitive_root,+1>(b);
    for (size_t i = 0; i < a.size(); ++i)
        a[i] = a[i] * b[i] % mod;
    fmt<mod,primitive_root,-1>(a);
    return a;
}
// general convolution where mod < 2^31.
inline vector<ll> conv(vector<ll> a, vector<ll> b, ll mod){
    int n = a.size() + b.size() - 1;
    for (int k: {1,2,4,8,16}) n |= (n >> k);
    ++n;
    a.resize(n); b.resize(n);
    const int A = 167772161, B = 469762049, C = 1224736769, D = (ll)(A) * B % mod;
    if(mod==A)return conv<A,3>(a,b);
    if(mod==B)return conv<B,3>(a,b);
    if(mod==C)return conv<C,3>(a,b);
    if(mod==924844033)return conv<924844033,5>(a,b);
    vector<ll> x = conv<A,3>(a,b), y = conv<B,3>(a,b), z = conv<C,3>(a,b);
    for (size_t i = 0; i < x.size(); ++i) {
        ll X = (y[i] - x[i]) * 104391568;
        if ((X %= B) < 0) X += B;
        ll Y = (z[i] - (x[i] + A * X) % C) * 721017874;
        if ((Y %= C) < 0) Y += C;
        x[i] += A * X + D * Y;
        if ((x[i] %= mod) < 0) x[i] += mod;
    }
    x.resize(n);
    return x;
}

inline poly mul(poly p, poly q, ll M) {
    poly pq = conv(p, q, M);
    pq.resize(p.size() + q.size() - 1);
    while (!pq.empty() && !pq.back()) pq.pop_back();
    return pq;
}

#include <ctime>
double tick() {
  static clock_t oldtick;
  clock_t newtick = clock();
  double diff = 1.0*(newtick - oldtick) / CLOCKS_PER_SEC;
  oldtick = newtick;
  return diff;
}
template <ll mod>
struct ModCombination{
    ll N;
    vector<ll> fact,inv,finv;

    ModCombination(ll n):N(n){
        fact.assign(n+1, 1);
        inv.assign(n+1, 1);
        finv.assign(n+1,1);
        for(int i=1;i<n;i++){
            fact[i+1] = fact[i]*(i+1)%mod;
            inv[i+1] = inv[mod%(i+1)]*(mod-mod/(i+1))%mod;
            finv[i+1] = finv[i]*inv[i+1]%mod;
        }
    }

    ll Comb(ll n,ll k){
        if(k<0||n<k)return 0;
        return (fact[n]*finv[k]%mod)*finv[n-k]%mod;
    }
};
ll N;
vll g[200010];
ll b[200010];
ll size[200010];
void dfs(ll v,ll p){
  size[v]=1;
  for(ll u:g[v])if(u!=p){
    dfs(u,v);
    size[v]+=size[u];
  }
  if(p!=-1){
    b[size[v]]++;
    b[N-size[v]]++;
  }
}
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  //tick();
  cin>>N;
  ModCombination<MOD> C(N+1);
  for(ll i=0;i<N-1;i++){
    ll a,b;cin>>a>>b;a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs(0,-1);
  poly c(N+1,0),d(N+1,0);
  for(ll i=0;i<=N;i++){
    //debug(b[i]);
    c[i] = b[i]*C.fact[i]%MOD;
    //debug(c[i]);
    d[i] = C.finv[N-i];
  }
  /*
  cerr<<c<<endl;
  cerr<<d<<endl;
  */

  poly e=mul(c,d,MOD);
  for(ll K=1;K<=N;K++){
    //debug(e[N+K]);
    ll ans = (N*C.Comb(N,K)%MOD-(e[N+K]*C.finv[K]%MOD)+MOD)%MOD;
    cout<<ans<<endl;
  }
  return 0;
}


Measured memory_bytes: 50000