#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
ll MOD = 0ll;


//ここから編集する
class Combination {

public:
    vector<ll> fact;

    Combination(int max_n) {
        //1 ~ n!までの階乗modを求める
        int n = max_n;
        vector<ll> fact(n + 1);
        fact[0] = 1;
        for (int i = 1; i <= n; i++) {
            fact[i] = (fact[i - 1] * i) % MOD;
        }
        this->fact = fact;
    }

    template<typename T>
    //templateをつかってみｔか
    ll pow(T x, int y) {
        if (y == 0) return 1;
        if (y == 1) return x;
        if (y == 2) return (x * x) % MOD;
//        if (y % 2 == 1) return pow(x, y / 2) * pow(x, y / 2) % MOD;
        if (y % 2 == 1) return pow(pow(x, y / 2), 2) * x % MOD;
//        return pow(x, y / 2) * pow(x, y / 2) % MOD;
        return pow(pow(x, y / 2), 2) % MOD;
    }

    ll nCk(int n, int k) {
//        return (fact[n] * pow(fact[n-k],MOD-2) * pow(fact[k],MOD-2)) % MOD;
        return (((fact[n] * pow(fact[n - k], MOD - 2)) % MOD) * pow(fact[k], MOD - 2)) % MOD;
    }

    /**
     * x ^ -1を求める
     */
    template<typename T>
    ll inv(T x) {
        return pow(x, MOD - 2);
    }
};

class Solve {
public:
    void solve() {
        int p;
        cin >> p;
        vector<int> b(p);
        MOD = p;
        Combination cmb(p);

        vector<vector<ll>> nck(p, vector<ll>(p));
        nck[1][0] = nck[1][1] = 1;
        for (int i = 2; i < p; ++i) {
            for (int j = 0; j < p; ++j) {
                if (j == 0 || j == i) {
                    nck[i][j] = 1;
                } else {
                    nck[i][j] = (nck[i - 1][j - 1] + nck[i - 1][j]) % MOD;
                }
            }
        }

        for (int i = 0; i < p; ++i) {
            int a;
            cin >> a;
            if (a == 1) {
                b[0]++;
//                for (int k = 0; k < p; ++k) {
////                    ll tmp = cmb.nCk(p - 1, k) * cmb.pow(-i, p - 1 - k) % MOD;
//                    ll tmp = nck[p - 1][k] * cmb.pow(-i, p - 1 - k) % MOD;
//                    b[k] -= tmp;
//                    b[k] %= MOD;
//                    if (b[k] < 0) b[k] += MOD;
//                }

                ll ipow = 1;
                for (int k = p - 1; k >= 0; --k) {
                    ll tmp = nck[p - 1][k] * ipow % MOD;
                    b[k] -= tmp;
                    b[k] %= MOD;
                    if (b[k] < 0) b[k] += MOD;
                    ipow *= -i;
                    ipow %= MOD;
                }
            }
        }

        for (int i = 0; i < p; ++i) {
            cout << b[i] << " ";
        }
        cout << endl;
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 70656