#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>
#include <atcoder/convolution>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

const int MOD = 998244353;

mint pow(mint a, ll n) {
    assert(n >= 0);
	mint ans = 1;
    while (n > 0) {
        if (n&1) ans = ans*a;
        a = a*a;
        n >>= 1;
    }
	return ans;
}

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

vector<mint> calc(vector<vector<mint>> v){
    if(v.size() == 1){
        return v[0];
    } 
    int n = v.size();
    vector<vector<mint>> vl, vr;
    for(int i = 0; i < n; i++){
        if(i*2 < n) vl.push_back(v[i]);
        else vr.push_back(v[i]);
    }
    return atcoder::convolution(calc(vl), calc(vr));
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<vector<mint>> v;
    for(int i = 0; i < n-1; i++){
        mint p2 = pow(mint(2), i);
        int x = p2.val()%(MOD-1);
        mint p10 = pow(mint(10), x);
        v.push_back({p10, mint(1)});
    }
    auto u = calc(v);
    vector<mint> uu(n);
    for(int i = 0; i < n; i++){
        int j = (n-i)%n;
        uu[j] = u[i];
    }
    vector<mint> b(n);
    for(int i = 0; i < n; i++) b[i] = a[i];
    auto w = atcoder::convolution(b, uu);
    vector<mint> ans(n);
    for(int i = 0; i < 2*n; i++) ans[i%n] += w[i];
    for(int i = 0; i < n; i++) cout << ans[i] << endl;
}