#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<long long> a(n - 1);
  for (int i = 0; i < n - 1; i++) cin >> a[i];
  long long mod = 1000000007;
  vector<long long> res(2 * n - 1);
  vector<long long> dp(2 * n - 1);
  dp[0] = 1;
  long long prod = 1;
  for (int i = 1; i < n; i++) {
    vector<long long> ndp(2 * n - 1);
    ndp[0] = 1;
    prod = prod * a[i - 1] % mod;
    for (int j = 1; j < (2 * n - 1); j++) {
      ndp[j] = dp[j - 1];
      res[j] = (res[j] + ndp[j] * prod % mod) % mod;
    }
    long long coef = 1;
    for (int j = 1; j <= i; j++) {
      ndp[j * 2] = (ndp[j * 2] + coef * (a[i - j] - 1) % mod) % mod;
      res[2 * j] = (res[2 * j] + coef * (a[i - j] - 1) % mod * prod % mod *
                                     ((mod + 1) / 2) % mod) %
                   mod;
      coef = coef * a[i - j] % mod;
    }
    dp = ndp;
  }
  for (int i = 1; i < (2 * n - 1); i++) {
    cout << res[i] << " ";
  }
  cout << "\n";
  return 0;
}
