#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;

#define rep(i, x, y) for (i64 i = i64(x), i##_max_for_repmacro = i64(y); i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

template <i64 p>
class fp {
    public:
    i64 x;
    fp() : x(0) {}
    fp(i64 x_) : x((x_ % p + p) % p) {}
    fp operator+() const { return fp(x); }
    fp operator-() const { return fp(-x); }
    fp& operator+=(const fp& y) {
        x += y.x;
        if (x >= p) x -= p;
        return *this;
    }
    fp& operator-=(const fp& y) { return *this += -y; }
    fp& operator*=(const fp& y) {
        x = x * y.x % p;
        return *this;
    }
    fp& operator/=(const fp& y) { return *this *= fp(inverse(y.x)); }
    fp operator+(const fp& y) const { return fp(x) += y; }
    fp operator-(const fp& y) const { return fp(x) -= y; }
    fp operator*(const fp& y) const { return fp(x) *= y; }
    fp operator/(const fp& y) const { return fp(x) /= y; }
    bool operator==(const fp& y) const { return x == y.x; }
    bool operator!=(const fp& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, p, x, y);
        return (x % p + p) % p;
    }
};

template <i64 p>
i64 abs(const fp<p>& x) { return x.x; }

template <i64 p>
ostream& operator<<(ostream& os, const fp<p>& x) {
    os << x.x;
    return os;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "[";
    for (const auto& v : vec) {
        os << v << ",";
    }
    os << "]";
    return os;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename A, typename T, size_t size>
void fill(A (&ary)[size], const T& val) {
    fill((T*)ary, (T*)(ary + size), val);
}

// x未満の要素の個数を返す
template <typename T>
i64 count_less(const vector<T>& v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

// x以下の要素の個数を返す
template <typename T>
i64 count_less_or_equal(const vector<T>& v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

// xより大きい要素の個数を返す
template <typename T>
i64 count_greater(const vector<T>& v, T x) {
    return end(v) - upper_bound(begin(v), end(v), x);
}

// x以上の要素の個数を返す
template <typename T>
i64 count_greater_or_equal(const vector<T>& v, T x) {
    return end(v) - lower_bound(begin(v), end(v), x);
}

// x未満の要素のうち最大のものを返す
template <typename T>
T max_less(const vector<T>& v, T x) {
    return *(lower_bound(begin(v), end(v), x) - 1);
}

// x以下の要素のうち最大のものを返す
template <typename T>
T max_less_or_equal(const vector<T>& v, T x) {
    return *(upper_bound(begin(v), end(v), x) - 1);
}

// xより大きい要素のうち最小のものを返す
template <typename T>
T min_greater(const vector<T>& v, T x) {
    return *upper_bound(begin(v), end(v), x);
}

// x以上の要素のうち最小のものを返す
template <typename T>
T min_greater_or_equal(const vector<T>& v, T x) {
    return *lower_bound(begin(v), end(v), x);
}

constexpr int inf = 1.01e9;
constexpr i64 inf64 = 4.01e18;
constexpr double eps = 1e-9;

class mint {
public:
    i64 x, m;
    mint() = default;
    mint(i64 m_, i64 x_) : m(m_), x((x_ % m_ + m_) % m_) {}
    mint operator+() const { return mint(m, x); }
    mint operator-() const { return mint(m, -x); }
    mint& operator+=(const mint& y) {
        if (m == 0) {
            assert(y.m != 0);
            m = y.m;
        }
        assert(m == y.m);
        x = ((x + y.x) % m + m) % m;
        return *this;
    }
    mint& operator-=(const mint& y) { return *this += -y; }
    mint& operator*=(const mint& y) {
        if (m == 0) {
            assert(y.m != 0);
            m = y.m;
        }
        assert(m == y.m);
        x = x * y.x % m;
        return *this;
    }
    mint& operator/=(const mint& y) { return *this *= mint(m, inverse(y.x)); }
    mint operator+(const mint& y) const { return mint(m, x) += y; }
    mint operator-(const mint& y) const { return mint(m, x) -= y; }
    mint operator*(const mint& y) const { return mint(m, x) *= y; }
    mint operator/(const mint& y) const { return mint(m, x) /= y; }
    bool operator==(const mint& y) const { return x == y.x; }
    bool operator!=(const mint& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, m, x, y);
        return (x % m + m) % m;
    }
};


ostream& operator<<(ostream& os, const mint& x) {
    os << x.x;
    return os;
}


void solve() {
    //constexpr i64 mod = 1'000'000'007;
    i64 p;
    cin >> p;

    vector<mint> a(p);
    rep(i,0,p){
        i64 x;
        cin >> x;
        a[i]=mint(p,x);
    }

    vector<mint> fact(p);
    fact[0]=mint(p,1);
    rep(i,1,p) fact[i]=fact[i-1]*mint(p,i);

    vector<mint> q(p+1,mint(p,0));
    q[0]=mint(p,0);
    q[1]=mint(p,1);
    rep(i,1,p){
        // X-i
        vector<mint> r(p+1);
        rep(j,0,p+1) r[j]=mint(p,0);

        rep(j,0,p+1) r[j]+=q[j]*mint(p,-i);
        rep(j,0,p) r[j+1]+=q[j];

        rep(j,0,p+1) q[j]=r[j];
    }

    print(q);

    vector<mint> ans(p);
    rep(i,0,p) ans[i]=mint(p,0);
    rep(i,0,p){
        if(a[i].x==0) continue;
        // 分母
        mint x=mint(p,1)/(fact[i]*fact[p-i-1])*((p-i-1)%2==1?mint(p,-1):mint(p,1));

        // 分子
        // q/(X-i)
        vector<mint> r(p,mint(p,0));
        mint c(p,0);
        for(i64 j=p; j>=1; --j){
            mint k=q[j]+c;
            r[j-1]=k;
            c=r[j-1]*mint(p,i);
        }
        print(x);
        print(r);
        rep(j,0,p) ans[j]+=x*r[j];
    }

    rep(i,0,p){
        cout << ans[i].x;
        if(i==p-1) cout << endl;
        else cout << " ";
    }
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}


Measured memory_bytes: 640