#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
const int mod = 1e9 + 7;
long long a[N], f0[2][N], f1[2][N], f2[2][N], f[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; i++) scanf("%lld", &a[i]);
  for (int i = n; i; i--) {
    int cur = i & 1, la = cur ^ 1;
    f0[cur][0] = 1;
    for (int j = 1; j <= (n - i) * 2; j++)
      f0[cur][j] = f1[cur][j] = f2[cur][j] = 0;
    for (int j = 1; j <= n - i; j++)
      f0[cur][j] = f0[cur][j - 1] * a[i + j - 1] % mod;
    for (int j = 2; j <= (n - (i + 1)) * 2; j++) {
      f2[cur][j + 2] = f2[la][j] * a[i] % mod * a[i] % mod;
      f1[cur][j + 2] = f2[la][j] * a[i] % mod * (a[i] - 1) % mod;
    }
    for (int j = 2; j <= n - i; j++) {
      f2[cur][j + 1] = (f2[cur][j + 1] + f0[cur][j] * a[i]) % mod;
      f1[cur][j + 1] = (f1[cur][j + 1] + f0[cur][j] * (a[i] - 1)) % mod;
    }
    long long sc = 1;
    for (int j = 1; j <= i - 1; j++) sc = sc * a[j] % mod;
    for (int j = 1; j <= (n - i) * 2; j++)
      f[j] = (f[j] + f1[cur][j] * sc) % mod;
    for (int j = 1; j <= n - i; j++)
      f[j * 2] = (f[j * 2] + f0[la][j - 1] * f0[la][j - 1] % mod *
                                 (a[i] * (a[i] - 1) / 2 % mod) % mod * sc) %
                 mod;
    for (int j = 1; j <= n - i; j++) f[j] = (f[j] + f0[cur][j] * sc) % mod;
  }
  for (int i = 1; i <= (n - 1) * 2; i++) printf("%lld ", f[i]);
  printf("\n");
  return 0;
}
