#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 3e5 + 5;
const long long INF = 1e14;
long long bpow(long long a, long long b, long long m) {
  long long x, y;
  x = 1;
  y = a;
  while (b > 0) {
    if (b % 2 == 1) x = (x * y) % MOD;
    y = (y * y) % MOD;
    b /= 2;
  }
  return x;
}
long long inv(long long i) { return bpow(i, MOD - 2, MOD); }
long long dp[3][10005][3];
long long a[5005];
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  long long a[5005];
  for (long long i = 0; i < n - 1; i++) {
    cin >> a[i + 1];
  }
  for (long long i = 0; i < 2 * n - 1; i++) {
    for (long long j = 0; j < 3; j++) dp[1][i][j] = dp[2][i][j] = 0;
  }
  dp[2][0][0] = 1;
  long long num = 1;
  for (long long r = 2; r < n + 1; r++) {
    for (long long j = 1; j < 2 * n - 1; j++)
      for (long long p = 0; p < 3; p++) {
        dp[0][j][p] = dp[1][j][p];
        dp[1][j][p] = dp[2][j][p];
      }
    long long i = 2;
    for (long long j = 1; j < 2 * n - 1; j++) {
      dp[i][j][0] =
          ((dp[i - 1][j][0] + dp[i - 1][j][1]) % MOD + dp[i - 1][j][2]) % MOD;
      if (j == 0) {
        dp[i][j][1] = 0;
      } else if (j == 1) {
        dp[i][j][1] = (num * a[r - 1]) % MOD;
      } else {
        dp[i][j][1] = (((dp[i - 1][j - 1][2] * 2) % MOD * a[r - 1]) % MOD +
                       (dp[i - 1][j - 1][1] * a[r - 1]) % MOD) %
                      MOD;
      }
      if (j == 0 || j == 1) {
        dp[i][j][2] = 0;
      } else if (j == 2) {
        dp[i][j][2] =
            (((num * a[r - 1]) % MOD * (a[r - 1] - 1)) % MOD * inv(2)) % MOD;
      } else {
        dp[i][j][2] = ((dp[i - 1][j - 2][2] * a[r - 1]) % MOD * a[r - 1]) % MOD;
      }
    }
    num = (num * a[r - 1]) % MOD;
  }
  for (long long j = 1; j < 2 * n - 1; j++) {
    long long ans = ((dp[2][j][0] + dp[2][j][1]) % MOD + dp[2][j][2]) % MOD;
    cout << ans << " ";
  }
  cout << "\n";
  return 0;
}
