// 愚直 O(n^2)
#include <iostream>
#include <vector>
using namespace std;

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

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

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