// 愚直 O(n^2)
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <vector>
using namespace std;

// #include <atcoder/modint>
// using mint = atcoder::modint998244353;

constexpr unsigned md = 998244353;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<unsigned> A(N), B(N + 1);
    for (auto &a : A) {
        int x;
        cin >> x;
        a = x;
    }
    A.push_back(0);
    unsigned base = 10;
    for (int iter = 0; iter < N - 1; ++iter) {
        A[N] = A[0];
        for (int i = 0; i < N; ++i) {
            // B[i] = A[i] * base + A[i + 1];
            B[i] = ((unsigned long long)A[i] * base + A[i + 1]) % md;
        }
        swap(A, B);
        base = (unsigned long long)base * base % md;
    }

    A.pop_back();
    for (auto a : A) cout << a << '\n';
}