#include <bits/stdc++.h>
using namespace std;
void sci() {}
template <typename... Args>
void sci(int &x, Args &...args) {
  scanf("%d", &x);
  sci(args...);
}
const int MAXN = 5e3 + 100;
const int mod = 1e9 + 7;
int A[MAXN], f[MAXN][MAXN << 1], prod[MAXN], invp[MAXN], ret[MAXN << 1], n;
int ksm(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % mod;
    b >>= 1;
    a = 1ll * a * a % mod;
  }
  return ret;
}
int inv(int x) { return ksm(x, mod - 2); }
void solve() {
  sci(n);
  for (int i = 1; i < n; i++) sci(A[i]);
  prod[0] = invp[0] = 1;
  for (int i = 1; i < n; i++) prod[i] = 1ll * prod[i - 1] * A[i] % mod;
  for (int i = 1; i < n; i++) invp[i] = inv(prod[i]);
  auto F = [&](int d, int k) {
    return 1ll * prod[d + k - 1] * invp[d] % mod * (A[d] - 1) % mod;
  };
  for (int i = 2; i <= n; i++) {
    f[i][1] = 1;
    for (int j = 2; j <= ((n - 1) << 1); j++) {
      f[i][j] = (f[i - 1][j - 1] + F(i - 1, j - 1)) % mod;
    }
  }
  for (int i = 1; i <= n; i++)
    for (int d = 1; d <= ((n - 1) << 1); d++)
      ret[d] = (ret[d] + 1ll * prod[i - 1] * f[i][d]) % mod;
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j <= n; j++) ret[i] = (ret[i] + prod[j - 1]) % mod;
  }
  int inv2 = inv(2);
  for (int i = 1; i <= ((n - 1) << 1); i++) ret[i] = 1ll * ret[i] * inv2 % mod;
  for (int i = 1; i <= ((n - 1) << 1); i++) cout << ret[i] << ' ';
  cout << endl;
}
int main() {
  solve();
  return 0;
}
