MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    N = int(data[0])
    a = list(map(int, data[1:N+1]))
    
    if N == 1:
        print(a[0] % MOD)
        return
    
    # Precompute pow10 for each step i (10^(2^{i-2} mod MOD))
    pow10 = [10 % MOD]  # for i=2, 2^{i-2} = 1
    for i in range(1, N-1):  # since i ranges from 2 to N, i-2 ranges from 0 to N-2
        pow10.append(pow(pow10[-1], 2, MOD))
    
    # Initialize the previous values
    prev = [ai % MOD for ai in a]
    for i in range(2, N+1):
        current = []
        exponent = pow10[i-2] if i-2 < len(pow10) else 0
        for j in range(N):
            next_j = (j + 1) % N
            val = (prev[j] * exponent + prev[next_j]) % MOD
            current.append(val)
        prev = current
    
    for val in prev:
        print(val % MOD)

if __name__ == '__main__':
    main()