#include <bits/stdc++.h>

namespace io
{
    const int bufsize = (1 << 20) + 10;

    char fin[bufsize], *p1 = fin, *p2 = fin;

    inline char nc()
    {
        return p1 == p2 && (p2 = (p1 = fin) + fread(fin, 1, bufsize, stdin), p1 == p2) ? EOF : *p1++;
    }

    template<typename T = int> inline T read()
    {
        T x = 0; int f = 0; char ch = nc();
        while (!isdigit(ch)) f |= ch == '-', ch = nc();
        while ( isdigit(ch)) x = x * 10 + ch - '0', ch = nc();
        return x;
    }

    char fout[bufsize], *q1 = fout, *q2 = fout + bufsize;

    inline void pc(char c)
    {
        if (q1 == q2) q2 = (q1 = fout) + fwrite(fout, 1, bufsize, stdout);
        *q1++ = c;
    }

    inline void pc(char *s)
    {
        while (*s) pc(*s++);
    }

    inline void flush()
    {
        fwrite(fout, 1, q1 - fout, stdout), fflush(stdout);
    }

    template<typename T> inline void put(T x)
    {
        if (x > 9) put(x / 10); pc(x % 10 + '0');
    }

    template<typename T> inline void write(T x, char ch = ' ')
    {
        put(x), pc(ch);
    }
}

const int N = 3e6 + 10, Mod = 998244353;

inline int chk(int a) {return a >= Mod ? a - Mod : a;}

inline int Pow(int a, int b, int mod = Mod)
{
    int res = 1;
    for (; b; b >>= 1, a = 1LL * a * a % mod)
        if (b & 1) res = 1LL * res * a % mod;
    return res;
}

namespace poly
{
    const int len = 21, G = 3, InvG = (Mod + 1) / G;

    int GPow[2][len + 1][1 << len];

    inline void init()
    {
        for (int p = 1; p <= len; ++p)
        {
            int buf0 = Pow(G, (Mod + 1) / (1 << p));
            int buf1 = Pow(InvG, (Mod + 1) / (1 << p));
            GPow[0][p][0] = GPow[1][p][0] = 1;
            for (int i = 1; i < (1 << p); ++i)
            {
                GPow[0][p][i] = 1LL * GPow[0][p][i - 1] * buf0 % Mod;
                GPow[1][p][i] = 1LL * GPow[1][p][i - 1] * buf1 % Mod;
            }
        }
    }

    int rev[N];

    inline void ntt(int *a, int len, int f = 0)
    {
        int k = 0; while ((1 << k) < len) k++;
        for (int i = 0; i < len; ++i)
        {
            rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << k - 1);
            if (i < rev[i]) std::swap(a[i], a[rev[i]]);
        }
        for (int l = 2, cnt = 1; l <= len; l <<= 1, ++cnt)
            for (int i = 0, m = l >> 1; i < len; i += l)
                for (int j = 0, *buf = GPow[f][cnt]; j < m; ++j, ++buf)
                {
                    int p = a[i + j], q = 1LL * a[i + j + m] * *buf % Mod;
                    a[i + j] = chk(p + q), a[i + j + m] = chk(p - q + Mod);
                }
        if (f)
        {
            int inv = Pow(len, Mod - 2);
            for (int i = 0; i < len; ++i) a[i] = 1LL * a[i] * inv % Mod;
        }
    }

    inline void inv(int n, int *a, int *b)
    {
        if (n == 1)
        {
            b[0] = Pow(a[0], Mod - 2);
            return;
        }
        inv(n + 1 >> 1, a, b);
        static int c[N]; int len = 1;
        while (len < 2 * n) len <<= 1;
        for (int i = 0; i <  n ; ++i) c[i] = a[i];
        for (int i = n; i < len; ++i) c[i] = b[i] = 0;
        ntt(b, len), ntt(c, len);
        for (int i = 0; i < len; ++i) b[i] = 1LL * b[i] * chk(Mod + 2 - 1LL * b[i] * c[i] % Mod) % Mod;
        ntt(b, len, 1);
        for (int i = n; i < len; ++i) b[i] = 0;
    }

    inline void ln(int n, int *a, int *b)
    {
        static int c[N]; int len = 1;
        for (int i = 1; i < n; ++i) c[i - 1] = 1LL * i * a[i] % Mod; c[n - 1] = 0;
        inv(n, a, b); while (len < 2 * n) len <<= 1;
        for (int i = n; i < len; ++i) c[i] = 0;
        ntt(b, len), ntt(c, len);
        for (int i = 0; i < len; ++i) b[i] = 1LL * b[i] * c[i] % Mod;
        ntt(b, len, 1);
        for (int i = n - 1; i >= 0; --i) b[i] = 1LL * b[i - 1] * Pow(i, Mod - 2) % Mod;
        b[0] = 0;
    }

    inline void exp(int n, int *a, int *b)
    {
        if (n == 1) return void(b[0] = 1);
        static int c[N];
        exp(n + 1 >> 1, a, b), ln(n, b, c);
        int len = 1; while (len < n * 2) len <<= 1;
        for (int i = 0; i <  n ; ++i) c[i] = chk(a[i] - c[i] + Mod); c[0] = chk(c[0] + 1);
        for (int i = n; i < len; ++i) c[i] = b[i] = 0;
        ntt(b, len), ntt(c, len);
        for (int i = 0; i < len; ++i) b[i] = 1LL * b[i] * c[i] % Mod;
        ntt(b, len, 1);
        for (int i = n; i < len; ++i) b[i] = 0;
    }
}

int a[N], b[N], c[N];

int main()
{
    int n = io::read(); poly::init();
    for (int i = 0; i < n; ++i) a[i] = io::read();
    poly::exp(n, a, b);
    for (int i = 0; i < n; ++i) io::write(b[i]);
    return io::flush(), 0;
}