#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int halfmod = 500000004;
const int N = 5005;
int n, ans, p[N], a[N], sum[N], dp[N], la2[N];
int main() {
  scanf("%d", &n);
  sum[1] = 1;
  for (int i = 1; i < n; i++)
    scanf("%d", &a[i]), sum[i + 1] = (long long)sum[i] * a[i] % mod;
  for (int i = 1; i <= n; i++) p[i] = 1;
  for (int k = 1; k <= 2 * n - 2; k++) {
    ans = 0;
    for (int i = n; i >= 2; i--) {
      if (k == 1)
        dp[i] = 1;
      else
        dp[i] =
            ((long long)dp[i - 1] + (long long)(a[i - 1] - 1) * la2[i] % mod) %
            mod;
      ans = ((long long)ans + (long long)sum[i] * dp[i] % mod) % mod;
    }
    for (int i = 1; i <= n; i++) la2[i] = p[i];
    for (int i = 1; i <= n - k; i++) p[i] = (long long)p[i + 1] * a[i] % mod;
    for (int i = n - k + 1; i <= n; i++) p[i] = 0;
    for (int i = 1; i <= n - k; i++)
      ans = ((long long)ans + (long long)sum[i] * p[i] % mod) % mod;
    printf("%d ", (long long)ans * halfmod % mod);
  }
  return 0;
}
