#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

/**
 * @attention 使用前にstatic変数Mを設定する。
 */
class RuntimeModInt{
public:
  static uint32_t M;
  
  uint64_t val;
  RuntimeModInt(): val(0){}
  RuntimeModInt(int64_t n){
    if(n >= M) val = n % M;
    else if(n < 0) val = n % M + M;
    else val = n;
  }
  
  inline const RuntimeModInt operator+(const RuntimeModInt &a) const {return RuntimeModInt((val+a.val)%M);}
  inline const RuntimeModInt operator-(const RuntimeModInt &a) const {return RuntimeModInt((val-a.val+M)%M);}
  inline const RuntimeModInt operator*(const RuntimeModInt &a) const {return RuntimeModInt((val*a.val)%M);}
  inline const RuntimeModInt operator/(const RuntimeModInt &a) const {return RuntimeModInt((val*a.inv().val)%M);}
  
  inline const RuntimeModInt& operator=(const RuntimeModInt &a){val = a.val; return *this;}
  inline const RuntimeModInt& operator+=(const RuntimeModInt &a){if((val += a.val) >= M) val -= M; return *this;}
  inline const RuntimeModInt& operator-=(const RuntimeModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}
  inline const RuntimeModInt& operator*=(const RuntimeModInt &a){(val *= a.val) %= M; return *this;}
  inline const RuntimeModInt& operator/=(const RuntimeModInt &a){(val *= a.inv().val) %= M; return *this;}

  inline const bool operator==(const RuntimeModInt &a) const {return val==a.val;}
  inline const bool operator!=(const RuntimeModInt &a) const {return val!=a.val;}

  const static RuntimeModInt power(LLI n, LLI p){
    RuntimeModInt ret = 1, e = n;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;
    return ret;
  }

  const RuntimeModInt power(LLI p) const {
    RuntimeModInt ret = 1, e = val;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;
    return ret;
  }
  
  const RuntimeModInt inv() const {
    int64_t a = val, b = M, u = 1, v = 0;

    while(b){
      int64_t t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    u %= M;
    if(u < 0) u += M;
    
    return u;
  }
};

RuntimeModInt operator-(const RuntimeModInt &a){return RuntimeModInt(-a.val);}

RuntimeModInt operator+(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)+b.val);}
RuntimeModInt operator-(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)-b.val);}
RuntimeModInt operator*(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)*b.val);}
RuntimeModInt operator/(int64_t a, const RuntimeModInt &b){return RuntimeModInt(RuntimeModInt(a)/b.val);}

uint32_t RuntimeModInt::M;

istream& operator>>(istream &is, RuntimeModInt &a){is >> a.val; return is;}
ostream& operator<<(ostream &os, const RuntimeModInt &a){ os << a.val; return os;}

using mint = RuntimeModInt;

template <typename T>
vector<T> lagrange_interpolation(const vector<T> &x, const vector<T> &y){
  int n = x.size() - 1;
  vector<T> ret(n+1);

  vector<T> c(n+1);
  REP(i,n+1){
    c[i] = y[i];
    T t = 1;
    REP(j,n+1){
      if(i != j){
        t *= x[i] - x[j];
      }
    }
    c[i] /= t;
  }
  
  vector<vector<T>> dp(n+1, vector<T>(n+2));

  dp[0][0] = -x[0];
  dp[0][1] = 1;

  FOR(i,1,n+1){
    REPE(j,n+1){
      dp[i][j] = dp[i-1][j] * (-x[i]);
      if(j >= 1) dp[i][j] += dp[i-1][j-1];
    }
  }

  vector<T> xinv(n+1);
  REPE(i,n){
    xinv[i] = (T)1 / x[i];
  }

  vector<vector<T>> dp2(n+1, vector<T>(n+1));
  REP(i,n+1){
    if(x[i] == 0){
      REPE(j,n) ret[j] += dp[n][j+1] * c[i];
    }else{
      REPE(j,n){
        if(j > 0) dp2[i][j] = -(dp[n][j] - dp2[i][j-1]) * xinv[i];
        else dp2[i][j] = -dp[n][j] * xinv[i];

        ret[j] += c[i] * dp2[i][j];
      }
    }    
  }
  
  return ret;
}

int main(){
  int p;
  while(cin >> p){
    mint::M = p;
    vector<mint> a(p); cin >> a;
    vector<mint> x(p);
    REP(i,p) x[i] = i;

    auto ans = lagrange_interpolation(x, a);

    join(cout, ALL(ans));
  }

  return 0;
}


Measured memory_bytes: 141184