#include <bits/stdc++.h>

using namespace std;
typedef vector<int> poly;

const int N = 5e6 + 10, MOD = 998244353;
inline int Plus(int a, int b) {return a + b >= MOD ? a + b - MOD : a + b; }
inline int Minus(int a, int b) {return a - b < 0 ? a - b + MOD : a - b; }
inline int ksm(long long a, int b) {
    long long r = 1;
    for(; b; b >>= 1, a = a * a % MOD)
        if(b & 1) r = r * a % MOD;
    return r;
}

int rev[N];
inline void NTT(poly &A, int type) {
// type == 1:= DFT
// type == -1:= IDFT
    static const int g = 3; // 原根
    int n = A.size();
    rev[0] = 0;
    for(int i = 1; i < n; i ++)
        rev[i] = ((rev[i >> 1] >> 1) | (i & 1) * (n >> 1));
    for(int i = 0; i < n; i ++)
        if(i < rev[i]) swap(A[i], A[rev[i]]);
    for(int h = 2; h <= n; h <<= 1) {
        long long step = ksm(g, (MOD - 1) / h);
        if(type == -1) step = ksm(step, MOD - 2);
        for(int i = 0; i < n; i += h) 
            for(int j = i, mul = 1; j < i + (h >> 1); j ++, mul = mul * step % MOD) {
                int u = A[j], v = 1ll * A[j + (h >> 1)] * mul % MOD;
                A[j] = Plus(u, v), A[j + (h >> 1)] = Minus(u, v);
            }
    }
    if(type == -1) {
        long long mul = ksm(n, MOD - 2);
        for(int i = 0; i < n; i ++)
            A[i] = A[i] * mul % MOD;
    }
}

poly operator + (const poly &lhs, const poly &rhs) {
    poly res = lhs; res.resize(max(lhs.size(), rhs.size()), 0);
    for(int i = 0; i < rhs.size(); i ++) res[i] = Plus(res[i], rhs[i]);
    return res;
}
poly operator - (const poly &lhs, const poly &rhs) {
    poly res = lhs; res.resize(max(lhs.size(), rhs.size()), 0);
    for(int i = 0; i < rhs.size(); i ++) res[i] = Minus(res[i], rhs[i]);
    return res;
}
poly operator * (const int lhs, const poly &rhs) {
    poly res = rhs;
    for(int i = 0; i < rhs.size(); i ++)
        res[i] = 1ll * res[i] * lhs % MOD;
    return res;
}
poly operator * (const poly &lhs, const int rhs) {
    poly res = lhs;
    for(int i = 0; i < lhs.size(); i ++)
        res[i] = 1ll * res[i] * rhs % MOD;
    return res;
}
poly operator * (poly A, poly B) {
    int h = 1;
    while(h <= A.size() + B.size()) h <<= 1;
    A.resize(h, 0), B.resize(h, 0);
    NTT(A, 1), NTT(B, 1);
    for(int i = 0; i < h; i ++) A[i] = 1ll * A[i] * B[i] % MOD;
    NTT(A, -1); return A;
}
inline poly inv(poly A, int n) {
    int h = 1; while(h <= n) h <<= 1; A.resize(h, 0);
    if(A.empty()) return poly();
    poly res(1, ksm(A[0], MOD - 2));
    for(int i = 2; i <= h; i <<= 1) {
        poly t = res; t.resize(i >> 1, 0), t.resize(i * 2, 0);
        t = t * t; t.resize(i * 2, 0); t = t * A; t.resize(i * 2, 0);
        res = 2 * res - t;
    }
    res.resize(n + 1); return res;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);

    int n; cin >> n; poly f(n);
    for(int i = 0; i < n; i ++) 
        cin >> f[i];
    poly g = inv(f, n);
    for(int i = 0; i < n; i ++)
        cout << g[i] << " \n"[i == n - 1];

    return 0;
}