#include <bits/stdc++.h>
using namespace std;
int n, son[5005], icnt[5005], cnt[5005], f[5005 << 1], dp[5005][5005 << 1];
int quick(int a, int b) {
  int c = 1;
  while (b) {
    if (b & 1) c = 1ll * c * a % 1000000007;
    a = 1ll * a * a % 1000000007;
    b >>= 1;
  }
  return c;
}
int dn(int x, int y) {
  if (x + y > n || y < 0) return 0;
  return 1ll * cnt[x + y] * icnt[x] % 1000000007;
}
void add(int &x, int y) { x = (x + y) % 1000000007; }
int main() {
  scanf("%d", &n);
  cnt[1] = 1;
  for (int i = 2; i <= n; i++)
    scanf("%d", &son[i]), cnt[i] = 1ll * cnt[i - 1] * son[i] % 1000000007;
  for (int i = 1; i <= n; i++) icnt[i] = quick(cnt[i], 1000000007 - 2);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i + n - 1; j++) {
      dp[i][j] = dn(i, j);
      add(dp[i][j],
          (1ll * dp[i - 1][j - 1] - (i == 1 ? 0 : dn(i, j - 2)) + 1000000007) %
              1000000007);
      add(f[j], 1ll * dp[i][j] * cnt[i] % 1000000007);
    }
  }
  for (int i = 1; i <= 2 * n - 2; i++)
    printf("%d ", 1ll * f[i] * quick(2, 1000000007 - 2) % 1000000007);
  return 0;
}
