#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(),(X).end()

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    sort(ALL(vec));
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}

inline ll popcnt(ll x){return __builtin_popcountll((unsigned long long)x);};
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
//friend bool operator<(const stc& lhs, const stc& rhs){
//    return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
//}



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll mod; cin >> mod;
    
    ll fact[mod], finv[mod];
    
//    auto nCk = [&](ll n, ll k){
//        if(n < k) return 0ll;
//        return fact[n] * (finv[k]*finv[n-k]%mod) %mod;
//    };
    
    auto modpow = [=](ll x, ll n){
        ll res = 1;
        while(n > 0){
            if(n & 1) res = res * x % mod;
            x = x * x % mod;
            n >>= 1;
        }
        return res;
    };
    
    auto inv = [&](ll x){
        return modpow(x, mod-2);
    };
    
    // prepare
    fact[0] = 1;
    rep(i, mod-1) fact[i+1] = fact[i]*(i+1)%mod;
    finv[mod-1] = inv(fact[mod-1]);
    for (ll i = mod-1; i > 0; i--) {
        finv[i-1] = finv[i]*i%mod;
    }
    
    vl A(mod); rep(i, mod) cin >> A[i];
    
    vl coef(mod, 0); ll modsq = mod*mod;
    rep(i, mod){
        if(A[i] == 0) continue;
        rep(k, mod){
            ll nck = fact[mod-1] * (finv[k]*finv[mod-1-k]%mod);
            if(nck > modsq) nck %= mod;
            ll expk = nck*(modpow(-i,mod-1-k)+mod)%mod;
            coef[k] = coef[k]-expk+mod;
        }
        coef[0] = (coef[0]+1)%mod;
    }
    
    rep(i, mod) cout << (coef[i]+mod)%mod << " ";
    cout << endstr;
    return 0;
}


Measured memory_bytes: 384