#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
int N;
long long F[30], C[30][30];
int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);
    std::cin >> N;
    for (int i = N ; i >= 0 ; i--) std::cin >> F[i];
    for (int i = 0 ; i <= N ; i++) C[i][0] = C[i][i] = 1;
    for (int i = 0 ; i <= N ; i++) for (int j = 1 ; j < i ; j++) C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
    std::vector<long long> ans(N + 1);
    for (int i = N ; i >= 0 ; i--) {
        for (int j = 0 ; j <= i ; j++) {
            ans[j] += C[i][j] * F[i] * ((j - i) % 2 ? -1 : +1);
        }
    }
    for (int i = N ; i >= 0 ; i--) std::cout << ans[i] << (i == 0 ? '\n' : ' ');
}