#include <bits/stdc++.h>

 #define dbg(x) cout << #x << "=" << x << endl

 using namespace std;

 typedef long long LL;

 template<class T>inline void read(T &res)

 {

     char c;T flag=;

     while((c=getchar())<''||c>'')if(c=='-')flag=-;res=c-'';

     while((c=getchar())>=''&&c<='')res=res*+c-'';res*=flag;

 }

 namespace _buff {

     const size_t BUFF =  << ;

     char ibuf[BUFF], *ib = ibuf, *ie = ibuf;

     char getc() {

         if (ib == ie) {

             ib = ibuf;

             ie = ibuf + fread(ibuf, , BUFF, stdin);

         }

         return ib == ie ? - : *ib++;

     }

 }

 int qread() {

     using namespace _buff;

     int ret = ;

     bool pos = true;

     char c = getc();

     for (; (c < '' || c > '') && c != '-'; c = getc()) {

         assert(~c);

     }

     if (c == '-') {

         pos = false;

         c = getc();

     }

     for (; c >= '' && c <= ''; c = getc()) {

         ret = (ret << ) + (ret << ) + (c ^ );

     }

     return pos ? ret : -ret;

 }

 const int kmaxn = ;

 LL f[kmaxn][kmaxn];

 const LL mod = 1e9 + ;

 int n;

 LL p[kmaxn];

 int main()

 {

     scanf("%d",&n);

     for(int i = ; i <= n; ++i) {

         scanf("%lld",&p[i]);

     }

     f[][] = ;

     for(int i = ; i <= n; ++i) {

         f[i][] = f[i-][] * (mod+-p[i]) % mod;

         for(int j = ; j <= n; ++j) {

             f[i][j] = ((f[i-][j]*(i-p[i]+mod)) % mod + f[i-][j-]*(mod+p[i]) % mod)% mod;

         }

     }

     for(int i = ; i < n; ++i) {

         printf("%lld ",f[n][i]);

     }

     printf("%lld\n",f[n][n]);

     return ;

 }