// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int P = 924844033;

const int N = 200000 + 5;

const int MAX = 524288 + 5;



int n;



vector <int> G[N];

int siz[N];



int f1[MAX];

int f2[MAX];



int a[N];



int fac[N];

int inv[N];



void dfs(int u, int fa) {

  siz[u] = 1;

  for (int i = 0; i < (int) G[u].size(); ++i) {

    int v = G[u][i];

    if (v == fa) {

      continue;

    }

    dfs(v, u);

    --a[siz[v]];

    siz[u] += siz[v];

  }

  --a[n - siz[u]];

}



int lim;

int bit;



int rev(int x) {

  int ret = 0;

  for (int i = 0; i < bit; ++i) {

    ret <<= 1;

    ret |= x & 1;

    x >>= 1;

  }

  return ret;

}



int revbit[MAX];

int g[MAX];



void fft(int *f, int bit, int o) {

  for (int i = 0; i < lim; ++i) {

    if (revbit[i] > i) {

      swap(f[revbit[i]], f[i]);

    }

  }

  for (int i = 0; i < bit; ++i) {

    int len = 1 << i;

    for (int j = 0; j < lim; j += 1 << i + 1) {

      int wn = 0;

      for (int k = j; k < j + len; ++k) {

        int t = (long long) f[k + len] * g[wn] % P;

        f[k + len] = (f[k] - t) % P;

        if (f[k + len] < 0) {

          f[k + len] += P;

        }

        f[k] = (f[k] + t) % P;

        wn += o * (1 << bit - i - 1);                        

        if (wn < 0) {

          wn += lim;

        }

      }

    }

  }

}



int modexp(int a, int x, int P) {

  int ret = 1;

  while (x) {

    if (x & 1) {

      ret = (long long) ret * a % P;

    }

    a = (long long) a * a % P;

    x >>= 1;

  }

  return ret;

}



void calc() {

  while ((1 << bit) < n + n) {

    ++bit;   

  }

  lim = 1 << bit;

  for (int i = 0; i < lim; ++i) {

    revbit[i] = rev(i);

  }

  g[0] = 1;

  g[1] = modexp(5, (P - 1) / lim, P);

  for (int i = 2; i < lim; ++i) {

    g[i] = (long long) g[i - 1] * g[1] % P;

  }

  fft(f1, bit, 1);

  fft(f2, bit, 1);

  for (int i = 0; i < lim; ++i) {

    f1[i] = (long long) f1[i] * f2[i] % P;

  }

  fft(f1, bit, -1);

  int invlim = modexp(lim, P - 2, P);

  for (int i = 0; i < lim; ++i) {

    f1[i] = (long long) f1[i] * invlim % P;

  }    

}



int main() {

  scanf("%d", &n);

  for (int i = 0, u, v; i < n - 1; ++i) {

    scanf("%d %d", &u, &v);

    --v;

    --u;

    G[u].push_back(v);

    G[v].push_back(u);

  }

  dfs(0, -1);

  a[n] = n;

  fac[0] = 1;

  for (int i = 1; i <= n; ++i) {

    fac[i] = (long long) fac[i - 1] * i % P;

  }

  inv[n] = modexp(fac[n], P - 2, P);

  for (int i = n - 1; i >= 0; --i) {

    inv[i] = (long long) inv[i + 1] * (i + 1) % P;

  }

  for (int i = 1; i <= n; ++i) {

    f1[n - i] = (long long) a[i] * fac[i] % P;

  }

  for (int i = 0; i <= n - 1; ++i) {

    f2[i] = inv[i];

  }

  calc();

  for (int i = n - 1; i >= 0; --i) {

    printf("%lld\n", (long long) f1[i] * inv[n - i] % P);

  }                  

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.428564067154678x):
#include<bits/stdc++.h>

#define rep(i,a,b) for(int i=(a),i##ed=(b);i<=i##ed;i++)

#define per(i,a,b) for(int i=(a),i##ed=(b);i>=i##ed;i--)

#define LNK(i,a) for(int i=hed[a];i;i=nxt[i])

using namespace std;

typedef long long ll;

const ll mod=924844033;

const int N=200010;

int n,num[N],sz[N];

int cnt=0,hed[N],to[N+N],nxt[N+N];

ll fa[N],fb[N];

ll a[N*4],b[N*4]; int lmt,l,r[N*4];



ll ksm(ll x,ll y) { ll s=1;for(;y;y/=2,x=x*x%mod) if(y%2) s=s*x%mod;return s; }

inline void add(int x,int y) { to[++cnt]=y,nxt[cnt]=hed[x],hed[x]=cnt; }

void dfs(int u,int ff) {

	sz[u]=1;

	LNK(i,u) if(to[i]^ff)

		dfs(to[i],u),sz[u]+=sz[to[i]],--num[sz[to[i]]],--num[n-sz[to[i]]];

}

void ntt(ll *A,int opt) {

	rep(i,0,lmt-1) if(i<r[i]) swap(A[i],A[r[i]]);

	for(int mid=1;mid<lmt;mid<<=1) {

		ll Wn=ksm(opt==1? 5:554906420,(mod-1)/(mid<<1));

		for(int R=mid<<1,j=0;j<lmt;j+=R) {

			ll w=1;

			for(int k=0;k<mid;k++,w=w*Wn%mod) {

				ll x=A[j+k],y=w*A[j+mid+k]%mod;

				A[j+k]=(x+y)%mod,A[j+mid+k]=(x-y+mod)%mod;

			}

		}

	}

	if(opt==-1) {

		ll inv=ksm(lmt,mod-2); rep(i,0,lmt-1) a[i]=a[i]*inv%mod;

	}

}

int main() {

	scanf("%d",&n);

	rep(i,2,n) { int x,y;scanf("%d%d",&x,&y),add(x,y),add(y,x); }

	rep(i,1,n) num[i]=mod; dfs(1,0),num[n]=n; rep(i,1,n) num[i]%=mod;

//	rep(i,1,n) printf("%d ",num[i]); puts("");

	fa[0]=fa[1]=fb[0]=fb[1]=1;

	rep(i,2,n) fa[i]=fa[i-1]*i%mod;

	rep(i,2,n) fb[i]=(mod-mod/i)*fb[mod%i]%mod;

	rep(i,2,n) fb[i]=fb[i-1]*fb[i]%mod;

	rep(i,1,n) a[n-i]=fa[i]*num[i]%mod,b[i-1]=fb[i-1];

//	rep(i,0,n-1) printf("%lld ",a[i]); puts("");

//	rep(i,0,n-1) printf("%lld ",b[i]); puts("");

	for(lmt=1,l=0;lmt<=n+n;lmt<<=1,++l);

	rep(i,0,lmt-1) r[i]=(r[i>>1]>>1)|((i&1)<<(l-1));

	ntt(a,1),ntt(b,1);

	rep(i,0,lmt-1) a[i]=a[i]*b[i]%mod;

	ntt(a,-1);

//	rep(i,0,n+n-2) printf("%lld ",a[i]); puts("");

	rep(i,1,n) printf("%lld\n",(a[n-i]*fb[i]%mod+mod)%mod);

	return 0;

}