#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 5010, LOG = 20;
long long n, m, k, u, v, x, y, t, a, b;
long long A[MAXN];
long long cnt[MAXN];
int dp[MAXN][2 * MAXN];
long long dp2[2][2 * MAXN];
long long ans[MAXN * 2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  cnt[1] = 1;
  for (long long i = 1; i < n; i++) {
    cin >> A[i];
    cnt[i + 1] = cnt[i] * A[i] % mod;
  }
  dp[n][0] = 1;
  for (int i = n - 1; i; i--) {
    dp[i][0] = 1;
    for (int j = 1; j < n; j++) dp[i][j] = dp[i + 1][j - 1] * A[i] % mod;
  }
  for (int j = 0; j <= 2 * n - 2; j++) ans[j] = dp2[0][j] = dp[1][j];
  for (int i = 2; i <= n; i++) {
    dp2[1][0] = 1;
    dp2[1][1] = 1 + A[i];
    for (int j = 2; j <= 2 * n - 2; j++)
      dp2[1][j] = (1ll * dp[i][j] + dp2[0][j - 1] - dp[i][j - 2]) % mod;
    for (int j = 1; j <= 2 * n - 2; j++)
      ans[j] = (ans[j] + dp2[1][j] * cnt[i]) % mod;
    for (int j = 0; j <= 2 * n - 2; j++) {
      dp2[0][j] = dp2[1][j];
      dp2[1][j] = 0;
    }
  }
  for (int i = 1; i <= 2 * n - 2; i++) {
    if (ans[i] < 0) ans[i] += mod;
    ans[i] = (ans[i] * (mod + 1) / 2) % mod;
    cout << ans[i] << ' ';
  }
  return 0;
}
