#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=200005,M=100005,mod=924844033;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

namespace NTT{
	const int M=524288;
	int rt,w[M],a[M],b[M];
	inline void fft(int *x,int n){
		for(int i=0,j=0;i<n;i++){
			if(i<j) swap(x[i],x[j]);
			for(int k=n>>1;(j^=k)<k;k>>=1);
		}
		for(int i=2;i<=n;i<<=1){
			int c=i>>1,now=n/i;
			for(int j=0;j<n;j+=i)
				for(int k=0;k<c;k++){
					int t=(ll)x[j+k+c]*w[now*k]%mod;
					x[j+k+c]=(x[j+k]-t)%mod;
					x[j+k]=(x[j+k]+t)%mod;
				}
		}
	}
	inline void mul(int *x,int *y,int n,int m,int *res,int k){
//		gmin(k,m+n);
		int maxx=1,wn;
		while(maxx<=(n+m)) maxx<<=1;
		for(int i=0;i<maxx;i++) a[i]=b[i]=0;
		for(int i=0;i<=n;i++) a[i]=x[i];
		for(int i=0;i<=m;i++) b[i]=y[i];
		w[0]=1;wn=exp(rt,(mod-1)/maxx);
		for(int i=1;i<=maxx;i++) w[i]=(ll)w[i-1]*wn%mod;
		fft(a,maxx);fft(b,maxx);
		for(int i=0;i<maxx;i++) a[i]=(ll)a[i]*b[i]%mod;
		reverse(w+1,w+maxx);
		fft(a,maxx);
		int inv=exp(maxx,mod-2);
		for(int i=0;i<=m+n&&i<=k;i++) res[i]=((ll)a[i]*inv%mod+mod)%mod;
		for(int i=m+n+1;i<=k;i++) res[i]=0;
	}
	inline void poly_inv(int *a,const int n,int *b){
		if(n==1){
			b[0]=exp(a[0],mod-2);
			return;
		}
		int b0[n+15],m=(n+1)/2;clr(b0,0);
		poly_inv(a,m,b0);
		mul(b0,b0,m-1,m-1,b,n-1);
		mul(a,b,n-1,n-1,b,n-1);
		for(int i=0;i<n;i++)
			b[i]=((ll)b0[i]*2-b[i]+mod)%mod;
	}
	inline void poly_div(int *a,int *b,int n,int m,int *d,int *r){
		reverse(a,a+n+1);reverse(b,b+m+1);
		poly_inv(b,n-m+1,d);
		mul(a,d,n-m,n-m,d,n-m);
		reverse(a,a+n+1);reverse(b,b+m+1);reverse(d,d+n-m+1);
		mul(b,d,m,n-m,r,n);
		for(int i=0;i<=n;i++)
			r[i]=(a[i]-r[i]+mod)%mod;
	}
	void clear(){
		if(!rt){
			for(rt=2;;rt++){
				int mn=mod-1;
				for(int d=1;d*d<=mod-1;d++){
					if((mod-1)%d!=0) continue;
					if(exp(rt,d)==1) gmin(mn,d);
					if(exp(rt,(mod-1)/d)==1) gmin(mn,(mod-1)/d);
				}
				if(mn==mod-1) break;
			}
			debug(rt);
		}
//		clr(a,0);clr(b,0);
//		clr(w,0);
	}
}

int n,fac[N],ifac[N],cnt[N<<1],si[N];
vi g[N];
bool vis[N];

inline void dfs(int x){
	vis[x]=1;si[x]=1;
	for(int y:g[x]){
		if(vis[y]) continue;
		dfs(y);
		cnt[si[y]]++;si[x]+=si[y];
	}
	if(x!=1) cnt[n-si[x]]++;
}

int main(){
#ifdef rqgao2014
	freopen("input.txt","r",stdin);
#endif
	NTT::clear();
	scanf("%d",&n);
	fac[0]=1;for(int i=1;i<=n;i++) fac[i]=(ll)fac[i-1]*i%mod;
	ifac[n]=exp(fac[n],mod-2);
	for(int i=n;i;i--) ifac[i-1]=(ll)ifac[i]*i%mod;
	
	for(int i=1;i<n;i++){
		int a,b;scanf("%d%d",&a,&b);
		g[a].pb(b);g[b].pb(a);
	}
	dfs(1);
	reverse(ifac,ifac+n+1);
	for(int i=0;i<=n;i++) cnt[i]=(ll)cnt[i]*fac[i]%mod;
	NTT::mul(ifac,cnt,n,n,cnt,n<<1);
	reverse(ifac,ifac+n+1);
	for(int i=1;i<=n;i++){
		int ans=((ll)fac[n]*ifac[i]%mod*ifac[n-i]%mod*n-(ll)cnt[i+n]*ifac[i])%mod;
		if(ans<0) ans+=mod;
		print(ans);
	}
	return 0;
}

Measured memory_bytes: 28672