#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert

using namespace std;

//-------------------------------------------------
//--ModInt
//-------------------------------------------------
::std::uint_fast64_t MOD = 1e9+7;

class mint
{
private:
    using value_type = ::std::uint_fast64_t;
    value_type n;
public:
    mint():n(0){}
    mint(::std::int_fast64_t _n):n(_n<0 ? MOD-(-_n)%MOD : _n%MOD){}
    mint(const mint &m):n(m.n){}

    friend ::std::ostream& operator<<(::std::ostream &os, const mint &a){
		return os << a.n;
	}
    friend ::std::istream& operator>>(::std::istream &is, mint &a){
        value_type temp; is>>temp;
        a = mint(temp);
        return is;
    }

    mint& operator+=(const mint &m){n+=m.n; n=(n<MOD)?n:n-MOD; return *this;}
    mint& operator-=(const mint &m){n+=MOD-m.n; n=(n<MOD)?n:n-MOD; return *this;}
    mint& operator*=(const mint &m){n=n*m.n%MOD; return *this;}
    mint& operator/=(const mint &m){return *this*=m.inv();}
    mint& operator++(){return *this+=1;}
    mint& operator--(){return *this-=1;}

    mint operator+(const mint &m) const {return mint(*this)+=m;}
    mint operator-(const mint &m) const {return mint(*this)-=m;}
    mint operator*(const mint &m) const {return mint(*this)*=m;}
    mint operator/(const mint &m) const {return mint(*this)/=m;}
    mint operator++(int){mint t(*this); *this+=1; return t;}
    mint operator--(int){mint t(*this); *this-=1; return t;}

    bool operator==(const mint &m) const {return n==m.n;}
    bool operator!=(const mint &m) const {return n!=m.n;}
    mint operator-() const {return mint(MOD-n);}

    mint pow(value_type b) const {
        mint ret(1), m(*this);
        while(b){
            if (b & 1) ret*=m;
            m*=m;
            b>>=1;
        }
        return ret;
    }

    mint inv() const {return pow(MOD-2);}
};

//-------------------------------------------------
//--Lagrange Polynomial
//-------------------------------------------------
template <class T>
T lagrange_interpolation(const vector<pair<T,T> > &ps, T x){
    T ret=0;
    int n = ps.size();
    for(int i=0;i<n;i++){
        T s=1,t=1;
        for(int j=0;j<n;j++)if(j!=i){
            s*=x-ps[j].first;
            t*=ps[i].first-ps[j].first;
        }
        ret+=ps[i].second * s/t;
    }
    return ret;
}

template <class T>
class Lagrange
{
private:
    int n;
    vector<T> poly;
public:
    Lagrange(const vector<pair<T,T> > &ps):n(ps.size()){
        vector<T> dp(n+1); dp[0]=1;
        for(int i=0;i<n;i++)for(int j=n;j>=0;j--){
            dp[j]*=-ps[i].first;
            if (j>=1) dp[j]+=dp[j-1];
        }
        reverse(dp.begin(),dp.end());
        poly.resize(n);
        for(int i=0;i<n;i++){
            T inv=1;
            for(int j=0;j<n;j++)if(j!=i)
                inv*=ps[i].first-ps[j].first;
            inv = ps[i].second/inv;
            vector<T> src = dp;
            for(int j=0;j<n;j++)if(src[j]!=0){
                poly[j]+=src[j]*inv;
                src[j+1]+=src[j]*ps[i].first;
            }
        }
    }
    T polation(T x){
        T ret=0, c=1;
        for(int i=0;i<n;i++){
            ret+=poly[i]*c;
            c*=x;
        }
        return ret;
    }
    T operator[](int k){return poly[k];}
};


//-------------------------------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int p; cin>>p; MOD=p;
    vector<pair<mint,mint> > A;
    rep(i,p){
        int a; cin>>a;
        A.emplace_back(i,a);
    }
    Lagrange<mint> lag(A);
    rep(i,p){
        if (i>0) cout<<" ";
        cout<<lag[p-i-1];
    }cout<<"\n";
    return 0;
}


Measured memory_bytes: 384