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

#define fs first
#define sc second

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 (b<a) { a=b; return 1; } return 0; }


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

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

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl


struct edge { int to, cost; };
ostream& operator<<(ostream& os, const edge& e) {
    os << "(" << e.to << ", " << e.cost << ")";
    return os;
}

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

int mod(int a, int p) {
    return ((a % p) + p) % p;
}

int modpow(int a, int n, int p) {
    a = mod(a, p);
    int res = 1;
    while (n > 0) {
        if (n & 1) (res *= a) %= p;
        (a *= a) %= p;
        n >>= 1;
    }
    return res;
}

int modinv(int a, int p) {
    a = mod(a, p);
    return modpow(a, p-2, p);
}

void mul(vector<int>& b, int a, int p) {
    vector<int> res(p+1);
    for (int i = 0; i <= p; ++i) if (b[i]) {
        (res[i+1] += b[i]) %= p;
        (res[i] += (b[i] * a)) %= p;
    }
    copy(res.begin(), res.end(), b.begin());
}

void inv(vector<int>& b, int a, int p) {
    vector<int> res(p+1);
    for (int i = p; i >= 0; --i) if (b[i]) {
        int ratio = b[i];
        (b[i] += mod(1*ratio, p)) %= p;
        (b[i-1] += mod(a*ratio, p)) %= p;
        res[i-1] = ratio;
    }
    copy(res.begin(), res.end(), b.begin());
}

int main()
{
    //assert(modpow(4, 4, 5) == 1);
    //assert(modinv(4, 5) == 4);

    //vector<int> v(3+1);
    //v[0] = 1;
    //for (int i = 0; i < 3; ++i) {
    //    mul(v, i, 3);
    //    DUMP(v);
    //}
    //assert(v[0] == 0);
    //assert(v[1] == 2);
    //assert(v[2] == 0);
    //assert(v[3] == 1);

    //inv(v, 1, 3);
    //DUMP(v);
    //assert(v[0] == 0);
    //assert(v[1] == 2);
    //assert(v[2] == 1);


    int p; cin >> p;
    vector<int> s;
    for (int i = 0; i < p; ++i) {
        int a; cin >> a;
        if (a) s.push_back(i);
    }

    int frac = 1;
    for (int i = 1; i < p; ++i) {
        (frac *= i) %= p;
    }

    vector<int> t(p+1);
    t[0] = 1;
    for (int i = 0; i < p; ++i) {
        mul(t, i, p);
    }

    vector<int> b(p+1);

    for (auto e : s) {
        vector<int> tmp(p+1);
        copy(t.begin(), t.end(), tmp.begin());
        inv(tmp, e, p);
        for (int i = 0; i <= p; ++i) {
            (b[i] += tmp[i]) %= p;
        }
    }

    for (int i = 0; i <= p; ++i) {
        (b[i] *= modinv(frac, p)) %= p;
    }

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

    return 0;
}


Measured memory_bytes: 384