#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef unsigned long long ull;
const int mod = 998244353, o = 15, len = 1 << o, b = 130;
int n, a[len], f[len], iv[len];
inline void reduce(int &x) {
    x += (x >> 31) & mod;
}
inline int power(int a, int n) {
    int tp = 1;

    while (n) {
        if (n & 1)
            tp = 1ll * tp * a % mod;

        a = 1ll * a * a % mod, n >>= 1;
    }

    return tp;
}
namespace poly {
int w[len], r[len], up, l;
void init() {
    const int w0 = power(3, (mod - 1) >> o);
    w[len >> 1] = 1;

    for (int i = (len >> 1) + 1; i < len; i++)
        w[i] = 1ll * w[i - 1] * w0 % mod;

    for (int i = (len >> 1) - 1; i; i--)
        w[i] = w[i << 1];

    iv[1] = 1;

    for (int i = 2, j; i <= n; i++) {
        j = mod / i + 1;
        iv[i] = 1ll * j * iv[i * j - mod] % mod;
    }
}
void ntt(int *a, int n, bool op) {
    static ull t[len], x, y;

    for (int i = 0; i < n; i++)
        t[i] = a[r[i]];

    for (int l = 1; l < n; l <<= 1) {
        int *k = w + l;

        for (ull *f = t; f != t + n; f += l)
            for (int *j = k; j != k + l; j++, f++) {
                x = *f, y = f[l] * *j % mod;
                f[l] = x + mod - y, *f += y;
            }
    }

    if (op) {
        for (int i = 0, x = mod - ((mod - 1) >> l); i < n; i++)
            a[i] = t[i] * x % mod;

        reverse(a + 1, a + n);
    } else
        for (int i = 0; i < n; i++)
            a[i] = t[i] % mod;
}
inline void pre(int n) {
    up = 1, l = 0;

    while (up <= n)
        up <<= 1, l++;

    for (int i = 0; i < up; i++)
        r[i] = (r[i >> 1] >> 1) | ((i & 1) << (l - 1));
}
void inv(int *a, int n, int *f) {
    static int x[len];

    if (!n) {
        f[0] = power(a[0], mod - 2);
        return;
    }

    int lt = (n == 1 ? 0 : (n + 1) >> 1);
    inv(a, lt, f);
    memcpy(x, a, (n + 1) << 2);
    pre(n + lt * 2), ntt(x, up, 0), ntt(f, up, 0);

    for (int i = 0; i < up; i++)
        reduce(f[i] = (2 * f[i] - 1ll * f[i] * f[i] % mod * x[i]) % mod);

    ntt(f, up, 1);
    fill(x, x + up, 0), fill(f + n + 1, f + up, 0);
}
void inver(int *a, int n, int *f) {
    static int x[len], y[len], g[b][len], py[len];

    for (int i = 0; i < n; i++)
        x[i] = a[i + 1];

    inv(x, n - 1, y);
    g[0][0] = 1, memcpy(g[1], y, n << 2);
    pre((n - 1) << 1);
    ntt(y, up, 0);
    memset(x, 0, sizeof x);

    for (int t = 2; t < b; t++) {
        memcpy(x, g[t - 1], n << 2);
        ntt(x, up, 0);

        for (int i = 0; i < up; i++)
            g[t][i] = 1ll * x[i] * y[i] % mod;

        ntt(g[t], up, 1);
        fill(g[t] + n, g[t] + up, 0), fill(x, x + up, 0);
    }

    memcpy(x, g[b - 1], n << 2);
    ntt(x, up, 0);
    py[0] = 1;

    for (int i = 0; i < up; i++)
        y[i] = 1ll * x[i] * y[i] % mod;

    ntt(y, up, 1), fill(y + n, y + up, 0), ntt(y, up, 0);

    for (int t = 0; t * b <= n; t++) {
        for (int j = 0; j < b && t * b + j <= n; j++) {
            ull s = 0;
            int p = t * b + j;

            for (int i = 0; i < p; i++) {
                s += 1ll * py[i] * g[j][p - 1 - i];

                if (!(i & 15))
                    s %= mod;
            }

            f[p] = s % mod * iv[p] % mod;
        }

        ntt(py, up, 0);

        for (int i = 0; i < up; i++)
            py[i] = 1ll * py[i] * y[i] % mod;

        ntt(py, up, 1);
        fill(py + n, py + up, 0);
    }
}
}
int main() {
    cin >> n, n--;

    for (int i = 0; i <= n; i++)
        scanf("%d", a + i);

    poly::init();
    poly::inver(a, n, f);

    for (int i = 0; i <= n; i++)
        printf("%d%c", f[i], " \n"[i == n]);
}