#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
    std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
    os << std::endl;
}

// mod int struct
// original : https://github.com/beet-aizu/library/blob/master/mod/mint.cpp

struct mint {
    ll v;
    ll mod;
    mint() : v(0) {}
    mint(signed v, ll mod = MOD) : v(v), mod(mod) {}
    mint(ll t, ll mod = MOD) : mod(mod) {
        v = t % mod;
        if (v < 0)
            v += mod;
    }

    mint pow(ll k) {
        mint res(1), tmp(v);
        while (k) {
            if (k & 1)
                res *= tmp;
            tmp *= tmp;
            k >>= 1;
        }
        return res;
    }

    static mint add_identity() { return mint(0); }
    static mint mul_identity() { return mint(1); }

    mint inv() { return pow(mod - 2); }

    mint &operator+=(mint a) {
        v += a.v;
        if (v >= mod)
            v -= mod;
        return *this;
    }
    mint &operator-=(mint a) {
        v += mod - a.v;
        if (v >= mod)
            v -= mod;
        return *this;
    }
    mint &operator*=(mint a) {
        v = 1LL * v * a.v % mod;
        return *this;
    }
    mint &operator/=(mint a) { return (*this) *= a.inv(); }

    mint operator+(mint a) const { return mint(v) += a; };
    mint operator-(mint a) const { return mint(v) -= a; };
    mint operator*(mint a) const { return mint(v) *= a; };
    mint operator/(mint a) const { return mint(v) /= a; };

    mint operator-() const { return v ? mint(mod - v) : mint(v); }

    bool operator==(const mint a) const { return v == a.v; }
    bool operator!=(const mint a) const { return v != a.v; }
    bool operator<(const mint a) const { return v < a.v; }

    // find x s.t. a^x = b
    ll log(ll a, ll b) {
        const ll sq = 40000;
        unordered_map<ll, ll> dp;
        dp.reserve(sq);
        mint res(1);
        for (int r = 0; r < sq; r++) {
            if (!dp.count(res.v))
                dp[res.v] = r;
            res *= a;
        }
        mint p = mint(a).inv().pow(sq);
        res = b;
        for (int q = 0; q <= mod / sq + 1; q++) {
            if (dp.count(res.v)) {
                ll idx = q * sq + dp[res.v];
                if (idx > 0)
                    return idx;
            }
            res *= p;
        }
        assert(0);
        return ll(-1);
    }

    static mint comb(long long n, int k) {
        mint num(1), dom(1);
        for (int i = 0; i < k; i++) {
            num *= mint(n - i);
            dom *= mint(i + 1);
        }
        return num / dom;
    }
};
ostream &operator<<(ostream &os, mint m) {
    os << m.v;
    return os;
}

// x座標が相異なるn+1点(x_i,y_i)を通るn次以下の多項式f(x)を返す
// O(n^2)
vector<mint> lagrange_interpolation(vector<mint> x, vector<mint> y) {
    const int n = x.size() - 1;
    for (int i = 0; i < n + 1; ++i) {
        mint t = 1;
        for (int j = 0; j < n + 1; ++j) {
            if (i != j)
                t *= x[i] - x[j];
        }
        y[i] /= t;
    }
    ll cur = 0, nxt = 1;
    vector<vector<mint>> dp(2, vector<mint>(n + 2));
    dp[0][0] = -x[0], dp[0][1] = 1;
    for (int i = 1; i < n + 1; ++i) {
        for (int j = 0; j < n + 2; ++j) {
            dp[nxt][j] = dp[cur][j] * -1 * x[i];
            if (j >= 1)
                dp[nxt][j] += dp[cur][j - 1];
        }
        swap(nxt, cur);
    }
    vector<mint> xinv(n + 1);
    for (int i = 0; i < n + 1; ++i)
        xinv[i] = x[i].inv();
    vector<mint> ret(n + 1, 0); // f(x)
    for (int i = 0; i < n + 1; ++i) {
        if (y[i] == 0)
            continue;
        // 0割り対策の場合分け
        if (x[i] == 0) {
            for (int j = 0; j < n + 1; ++j) {
                ret[j] += dp[cur][j + 1] * y[i];
            }
        } else {
            ret[0] -= dp[cur][0] * xinv[i] * y[i];
            mint pre = -dp[cur][0] * xinv[i];
            for (int j = 1; j < n + 1; ++j) {
                ret[j] -= (dp[cur][j] - pre) * xinv[i] * y[i];
                pre = -(dp[cur][j] - pre) * xinv[i];
            }
        }
    }
    return ret;
}

int main() {
    int p;
    cin >> p;
    MOD = p;
    vector<mint> a(p, 0);
    for (int i = 0; i < p; ++i) {
        int aa;
        cin >> aa;
        a[i] = aa;
    }
    vector<mint> x(p);
    for (int i = 0; i < p; ++i) {
        x[i] = i;
    }
    auto ret = lagrange_interpolation(x, a);
    print(ret);
    return 0;
}

Measured memory_bytes: 768