#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

struct NumberTheoreticTransform
{
  int mod;
  int primitiveroot;

  NumberTheoreticTransform(int mod, int root) : mod(mod), primitiveroot(root) {}

  inline int mod_pow(int x, int n)
  {
    int ret = 1;
    while(n > 0) {
      if(n & 1) ret = mul(ret, x);
      x = mul(x, x);
      n >>= 1;
    }
    return ret;
  }

  inline int inverse(int x)
  {
    return (mod_pow(x, mod - 2));
  }

  inline int add(unsigned x, int y)
  {
    x += y;
    if(x >= mod) x -= mod;
    return (x);
  }

  inline int mul(int a, int b)
  {
    unsigned long long x = (long long) a * b;
    unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
    asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
    return (m);
  }

  void DiscreteFourierTransform(vector< int > &F, bool rev)
  {
    const int N = (int) F.size();
    for(int i = 0, j = 1; j + 1 < N; j++) {
      for(int k = N >> 1; k > (i ^= k); k >>= 1);
      if(i > j) swap(F[i], F[j]);
    }
    int w, wn, s, t;
    for(int i = 1; i < N; i <<= 1) {
      w = mod_pow(primitiveroot, (mod - 1) / (i * 2));
      if(rev) w = inverse(w);
      for(int k = 0; k < i; k++) {
        wn = mod_pow(w, k);
        for(int j = 0; j < N; j += i * 2) {
          s = F[j + k], t = mul(F[j + k + i], wn);
          F[j + k] = add(s, t), F[j + k + i] = add(s, mod - t);
        }
      }
    }
    if(rev) {
      int temp = inverse(N);
      for(int i = 0; i < N; i++) F[i] = mul(F[i], temp);
    }
  }

  vector< int > Multiply(const vector< int > &A, const vector< int > &B)
  {
    int sz = 1;
    while(sz < A.size() + B.size() - 1) sz <<= 1;
    vector< int > F(sz), G(sz);
    for(int i = 0; i < A.size(); i++) F[i] = A[i];
    for(int i = 0; i < B.size(); i++) G[i] = B[i];
    DiscreteFourierTransform(F, false);
    DiscreteFourierTransform(G, false);
    for(int i = 0; i < sz; i++) F[i] = mul(F[i], G[i]);
    DiscreteFourierTransform(F, true);
    F.resize(A.size() + B.size() - 1);
    return (F);
  }
};

const ll MOD=924844033;

ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
	return powmod(a, MOD-2);
}
ll f[200001], invf[200001];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
    invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
}
ll comb(int x, int y){
    if(x<y) return 0;
    return f[x]*invf[y]%MOD*invf[x-y]%MOD;
}
int n;
vector<int> g[200001];
bool used[200001];
int ct[200001];
ll c[200001];
void dfs(int x){
  used[x]=1;
  ct[x]=1;
  for(auto y:g[x]){
    if(!used[y]){
      dfs(y);
      ct[x]+=ct[y];
      c[ct[y]]++;
    }
  }
  c[n-ct[x]]++;
}
vector<int> add(vector<int> a, vector<int> b){
  int m=max(a.size(), b.size());
  vector<int> ret(m, 0);
  for(int i=0; i<a.size(); i++){
    ret[i]=a[i];
  }
  for(int i=0; i<b.size(); i++){
    ret[i]+=b[i];
    if(ret[i]>=MOD) ret[i]-=MOD;
  }
  return ret;
}
vector<int> solve(int l, int r){
  if(l==r){
    vector<int> ret(1, c[l]);
    return ret;
  }
  int m=(l+r)/2;
  vector<int> p=solve(l, m);
  vector<int> q0(m+2-l);
  for(int i=0; i<=m+1-l; i++){
    q0[i]=comb(m+1-l, i);
  }
  vector<int> q1=solve(m+1, r);
  NumberTheoreticTransform ntt(MOD, 5);
  vector<int> q=ntt.Multiply(q0, q1);
  vector<int> ret=add(p, q);
  ret.resize(r-l+1);
  return ret;
}
int main()
{
	cin>>n;
  for(int i=0; i<n-1; i++){
    int a, b; cin>>a>>b; a--; b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs(0);
  fac(n);
  vector<int> ans=solve(0, n-1);
  for(ll i=1; i<n; i++){
    cout<<(comb(n, i)*(ll)n-(ll)ans[i]+MOD)%MOD<<endl;
  }
  cout<<n<<endl;
	return 0;
}

Measured memory_bytes: 31344