#include <bits/stdc++.h>
using namespace std;
const int maxn = 5010, mod = 1e9 + 7;
int n, a[maxn], sum[maxn], f[maxn][maxn * 2], ans[maxn * 2];
int main() {
  scanf("%d", &n);
  sum[1] = 1;
  for (int i = 1; i < n; i++) scanf("%d", &a[i]);
  for (int i = 2; i <= n; i++) sum[i] = 1LL * sum[i - 1] * a[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 * f[i + 1][j - 1] * a[i] % mod;
      ans[j] = (ans[j] + 1LL * f[i][j] * sum[i] % mod) % 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 && j - 2 < n && j - 2 >= 0)
        f[i][j] = (f[i][j] + 1LL * f[i][j - 2] * (a[i - 1] - 1) % mod) % mod;
      ans[j] = (ans[j] + 1LL * f[i][j] * sum[i] % mod) % mod;
    }
  for (int i = 1; i <= 2 * n - 2; i++)
    printf("%d ", 1LL * ans[i] * (mod + 1) / 2 % mod);
  return 0;
}
