#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint p;
    cin >> p;
    vec<lint> a_list(p);
    range(i, 0, p) cin >> a_list.at(i);
    vec<lint> factorial(p), inv_factorial(p);
    factorial.at(0) = 1, inv_factorial.at(0) = 1;
    range(i, 1, p) {
        factorial.at(i) = factorial.at(i - 1) * i % p;
        inv_factorial.at(i) = pow(factorial.at(i), p - 2, p);
    }
    vec<lint> combination(p);
    range(i, 0, p) {
        combination.at(i) = factorial.at(p - 1) * inv_factorial.at(i) % p
            * inv_factorial.at(p - 1 - i) % p;
    }
    vec<vec<lint>> pow_neg(p, vec<lint>(p));
    range(j, 0, p) {
        lint cur_val = 1;
        range(i, 0, p) {
            pow_neg.at(j).at(i) = cur_val;
            cur_val *= (-j + p);
            cur_val %= p;
        }
    }
    vec<lint> b(p);
    range(j, 0, p) {
        if (a_list.at(j) == 0) continue;
        b.at(0) += 1;
        b.at(0) %= p;
        range(i, 0, p) {
            lint coef = combination.at(i) * pow_neg.at(j).at(p - 1 - i) % p;
            b.at(i) -= coef;
            if (b.at(i) < 0) b.at(i) += p;
            b.at(i) %= p;
        }
    }
    range(i, 0, p) cout << b.at(i) << " ";
    cout << "\n";
}

Measured memory_bytes: 70912