#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize(3)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("sse3","sse2","sse")
//#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
//#pragma GCC target("f16c")
//#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
//#pragma GCC diagnostic error "-fwhole-program"
//#pragma GCC diagnostic error "-fcse-skip-blocks"
//#pragma GCC diagnostic error "-funsafe-loop-optimizations"
//#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"

#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define REP(x, l, u) for(ll x = l;x<u;x++)
#define RREP(x, l, u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(begin(a),end(a)),end(a))
#define mst(x, a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rall(a) rbegin(a),rend(a)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define lowbit(x) ((x)&(-(x)))
#define bitcnt(x) (__builtin_popcountll(x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define sz(x) ((int)x.size())
#define EX0 exit(0);

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace __gnu_pbds; //required
using namespace std;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<ll> VLL;
typedef vector<int> VI;
const ll mod = 924844033;


string to_string (string s) { return '"' + s + '"'; }

string to_string (const char *s) { return to_string ((string) s); }

string to_string (bool b) { return (b ? "true" : "false"); }

template<typename A, typename B>
string to_string (pair<A, B> p) { return "(" + to_string (p.first) + ", " + to_string (p.second) + ")"; }

template<typename A>
string to_string (A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) { res += ", "; }
        first = false;
        res += to_string (x);
    }
    res += "}";
    return res;
}

void debug_out () { cerr<<endl; }

template<typename Head, typename... Tail>
void debug_out (Head H, Tail... T) {
    cerr<<" "<<to_string (H);
    debug_out (T...);
}

#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) {}
#endif

template<typename T, typename S>
inline bool upmin (T &a, const S &b) { return a > b ? a = b, 1 : 0; }

template<typename T, typename S>
inline bool upmax (T &a, const S &b) { return a < b ? a = b, 1 : 0; }


ull twop (ll x) { return 1ULL<<x; }

ll MOD (ll a, ll m) {
    a %= m;
    if (a < 0)a += m;
    return a;
}

ll inverse (ll a, ll m) {
    a = MOD (a, m);
    if (a <= 1)return a;
    return MOD ((1 - inverse (m, a) * m) / a, m);
}

template<typename T>
T sqr (T x) { return x * x; }

ll gcd (ll a, ll b) {
    a = abs (a), b = abs (b);
    while (b != 0) {
        a %= b;
        swap (a, b);
    }
    return a;
}

ll fast (ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1)ans *= a;
        a *= a;
        b /= 2;
    }
    return ans;
}

ll fast (ll a, ll b, ll mod) {
    if (b < 0)a = inverse (a, mod), b = -b;
    ll ans = 1;
    while (b) {
        if (b & 1)ans = ans * a % mod;
        a = a * a % mod;
        b /= 2;
    }
    return ans % mod;
}

namespace fft {
    const int N = 1<<20, M = 31768;
    
    struct Complex {
        double x, y;
        
        Complex () { x = y = 0; }
        
        Complex (double _x, double _y) { x = _x, y = _y; }
        
        Complex operator+ (const Complex &r) const {
            return Complex (x + r.x, y + r.y);
        }
        
        Complex operator- (const Complex &r) const {
            return Complex (x - r.x, y - r.y);
        }
        
        Complex operator* (const double k) const {
            return Complex (x * k, y * k);
        }
        
        Complex operator/ (const double k) const {
            return Complex (x / k, y / k);
        }
        
        Complex operator* (const Complex &r) const {
            return Complex (x * r.x - y * r.y, x * r.y + y * r.x);
        }
        
        int operator= (const int a) {
            *this = Complex (a, 0);
            return a;
        }
        
        Complex conj () const {
            return Complex (x, -y);
        }
    };
    
    const double pi = acos (-1.0);
    Complex w[N];
    int rev[N];
    
    void init (int L) {
        int n = 1<<L;
        for (int i = 0; i < n; ++i) {
            double ang = 2 * pi * i / n;
            w[i] = Complex (cos (ang), sin (ang));
            rev[i] = (rev[i>>1]>>1) | ((i & 1)<<(L - 1));
        }
    }
    
    void trans (Complex P[], int n, int oper) {
        for (int i = 0; i < n; i++) {
            if (i < rev[i]) {
                std::swap (P[i], P[rev[i]]);
            }
        }
        for (int d = 0; (1<<d) < n; d++) {
            int m = 1<<d, m2 = m * 2, rm = n / m2;
            for (int i = 0; i < n; i += m2) {
                for (int j = 0; j < m; j++) {
                    Complex &P1 = P[i + j + m], &P2 = P[i + j];
                    Complex t = w[rm * j] * P1;
                    P1 = P2 - t;
                    P2 = P2 + t;
                }
            }
        }
        if (oper == -1) {
            for (int i = 0; i < n; ++i) {
                P[i] = P[i] / n;
            }
        }
    }
    
    Complex A[N], B[N], C1[N], C2[N];
    
    std::vector<ll> conv (const std::vector<int> &a, const std::vector<int> &b) {
        int n = a.size (), m = b.size (), L = 0, s = 1;
        while (s <= n + m - 2) s <<= 1, ++L;
        init (L);
        for (int i = 0; i < s; ++i) {
            A[i] = i < n ? Complex (a[i], 0) : Complex ();
            B[i] = i < m ? Complex (b[i], 0) : Complex ();
        }
        trans (A, s, 1);
        trans (B, s, 1);
        for (int i = 0; i < s; ++i) {
            A[i] = A[i] * B[i];
        }
        for (int i = 0; i < s; ++i) {
            w[i] = w[i].conj ();
        }
        trans (A, s, -1);
        std::vector<ll> res (n + m - 1);
        for (int i = 0; i < n + m - 1; ++i) {
            res[i] = (ll) (A[i].x + 0.5);
        }
        return res;
    }
    
    std::vector<ll> fast_conv (const std::vector<int> &a, const std::vector<int> &b) {
        int n = a.size (), m = b.size (), L = 0, s = 1;
        for (; s <= n + m - 2; s <<= 1, ++L);
        s >>= 1, --L;
        init (L);
        for (int i = 0; i < s; ++i) {
            A[i].x = (i<<1) < n ? a[i<<1] : 0;
            B[i].x = (i<<1) < m ? b[i<<1] : 0;
            A[i].y = (i<<1 | 1) < n ? a[i<<1 | 1] : 0;
            B[i].y = (i<<1 | 1) < m ? b[i<<1 | 1] : 0;
        }
        trans (A, s, 1);
        trans (B, s, 1);
        for (int i = 0; i < s; ++i) {
            int j = (s - i) & (s - 1);
            C1[i] = (Complex (4, 0) * (A[j] * B[j]).conj () -
                     (A[j].conj () - A[i]) * (B[j].conj () - B[i]) * (w[i] + Complex (1, 0))) * Complex (0, 0.25);
        }
        std::reverse (w + 1, w + s);
        trans (C1, s, -1);
        std::vector<ll> res (n + m);
        for (int i = 0; i <= (n + m - 1) / 2; ++i) {
            res[i<<1] = ll (C1[i].y + 0.5);
            res[i<<1 | 1] = ll (C1[i].x + 0.5);
        }
        res.resize (n + m - 1);
        return res;
    }
    
    // arbitrary modulo convolution
    void conv (int a[], int b[], int n, int m, int mod, int res[]) {
        int s = 1, L = 0;
        while (s <= n + m - 2) s <<= 1, ++L;
        init (L);
        for (int i = 0; i < s; ++i) {
            A[i] = i < n ? Complex (a[i] / M, a[i] % M) : Complex ();
            B[i] = i < m ? Complex (b[i] / M, b[i] % M) : Complex ();
        }
        trans (A, s, 1);
        trans (B, s, 1);
        for (int i = 0; i < s; ++i) {
            int j = i ? s - i : i;
            Complex a1 = (A[i] + A[j].conj ()) * Complex (0.5, 0);
            Complex a2 = (A[i] - A[j].conj ()) * Complex (0, -0.5);
            Complex b1 = (B[i] + B[j].conj ()) * Complex (0.5, 0);
            Complex b2 = (B[i] - B[j].conj ()) * Complex (0, -0.5);
            Complex c11 = a1 * b1, c12 = a1 * b2;
            Complex c21 = a2 * b1, c22 = a2 * b2;
            C1[j] = c11 + c12 * Complex (0, 1);
            C2[j] = c21 + c22 * Complex (0, 1);
        }
        trans (C1, s, -1);
        trans (C2, s, -1);
        for (int i = 0; i < n + m - 1; ++i) {
            int x = ll (C1[i].x + 0.5) % mod;
            int y1 = ll (C1[i].y + 0.5) % mod;
            int y2 = ll (C2[i].x + 0.5) % mod;
            int z = ll (C2[i].y + 0.5) % mod;
            res[i] = ((ll) x * M * M + (ll) (y1 + y2) * M + z) % mod;
        }
    }
}
const ll maxn = 1000010;
ll fac[maxn], facinv[maxn], inv[maxn];

void init () {
    fac[0] = 1;
    REP(i, 1, maxn)fac[i] = i * (fac[i - 1]) % mod;
    facinv[maxn - 1] = inverse (fac[maxn - 1], mod);
    RREP(i, maxn - 2, 0) {
        facinv[i] = facinv[i + 1] * (i + 1) % mod;
    }
    inv[1] = 1;
    for (int i = 2; i < maxn; i++)
        inv[i] = (mod - (ll) mod / i * inv[mod % i] % mod);
}

ll combi (int n, int m) {
    if (n < 0 || m < 0 || n < m)return 0;
    return fac[n] * facinv[m] % mod * facinv[n - m] % mod;
}


namespace SOLVE {
    VLL adj[200010];
    int sum[200010];
    int cnt[200100];
    int n;
    
    void dfs (int cur, int fa) {
        sum[cur] = 1;
        for (auto s:adj[cur]) {
            if (s != fa) {
                dfs (s, cur);
                sum[cur] += sum[s];
                cnt[sum[s]]++;
                cnt[n - sum[s]]++;
            }
        }
    }
    
    const ll N = 1000100;
    int A[N], B[N], C[N], ans[N];
    
    void main () {
        init ();
        cin>>n;
        REP(i, 1, n) {
            ll a, b;
            cin>>a>>b;
            adj[a].PB (b);
            adj[b].PB (a);
        }
        dfs (1, 0);
        REP(j, 0, n + 1) {
            A[n - j] = cnt[j] * fac[j] % mod;
            B[j] = facinv[j];
        }
        fft::conv (A, B, n + 1, n + 1, mod, C);
        REP(i, 1, n + 1) {
            ans[i] = -C[n - i] * facinv[i] % mod;
            ans[i] += (n) * combi (n, i) % mod;
        }
        REP(i, 1, n + 1) {
            cout<<MOD (ans[i], mod)<<"\n";
        }
    }
}


signed main () {
#ifdef LOCAL
    fr("/Users/zhangqingchuan/Desktop/cp/cp/input.txt");
    fw("/Users/zhangqingchuan/Desktop/cp/cp/output.txt");
#endif
    
    
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout<<"Case #"<<i<<": ";
        SOLVE::main ();
        
    }








//    clock_t st = clock();
//    while(clock() - st < 3.0 * CLOCKS_PER_SEC){
//
//    }
    
    
    
    
    
    
    return 0;
}


Measured memory_bytes: 144768