#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
int a[5001], c[5005];
int f[5001][9999], ans[9999];
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  c[0] = 1;
  for (int i = 1; i < n; i++) cin >> a[i];
  for (int i = 1; i < n; i++) c[i] = 1ll * a[i] * c[i - 1] % mod;
  for (int i = n; i >= 1; i--) {
    f[i][0] = 1;
    for (int j = 1; j <= n - i; j++) {
      f[i][j] = (1ll * a[i] * f[i + 1][j - 1]) % mod;
      ans[j] = (1ll * f[i][j] * c[i - 1] + ans[j]) % mod;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 2 * n - 2; j >= 1; j--) {
      f[i][j] = f[i - 1][j - 1];
      if (i > 1 && j > 1)
        f[i][j] = (1ll * (a[i - 1] - 1) * f[i][j - 2] + f[i][j]) % mod;
      ans[j] = (1ll * f[i][j] * c[i - 1] + ans[j]) % mod;
    }
  }
  for (int i = 1; i <= 2 * n - 2; i++) {
    cout << (mod + 1ll) * ans[i] / 2 % mod << ' ';
  }
}
