MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    a = list(map(int, input[1:N+1]))
    
    # Precompute p_i = 10^{2^{i-2}} mod MOD for i >= 2
    p = [0] * (N + 2)  # p[2] to p[N]
    if N >= 2:
        p[2] = pow(10, 1, MOD)
        for i in range(3, N+1):
            p[i] = pow(p[i-1], 2, MOD)
    
    # Initialize X_1 as a
    X = a.copy()
    
    for i in range(2, N+1):
        new_X = [0] * N
        len_p = 2 ** (i-2)
        p_i = p[i]
        for j in range(N):
            j_next = (j + 1) % N
            new_X[j] = (X[j] * p_i + X[j_next]) % MOD
        X = new_X
    
    for j in range(N):
        print(X[j] % MOD)

if __name__ == '__main__':
    main()