#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream& operator>>(istream& is, vector<T>& a) {
  for (T& ai : a) is >> ai;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> const& a) {
  os << "[ ";
  for (const T& ai : a) os << ai << " ";
  return os << "]";
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& a) {
  return is >> a.first >> a.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> const& a) {
  return os << "(" << a.first << ", " << a.second << ")";
}
const int M = 1000000007;
int egcd(int a, int b, int& x, int& y) {
  if (a < b) return egcd(b, a, y, x);
  int bx = 0, by = 1, q, r, rx, ry;
  x = 1;
  y = 0;
  while (b) {
    q = a / b;
    r = a % b;
    rx = x - q * bx;
    ry = y - q * by;
    a = b;
    x = bx;
    y = by;
    b = r;
    bx = rx;
    by = ry;
  }
  return a;
}
int mod_inv(int a) {
  int x, y;
  egcd(a, M, x, y);
  if (x < 0) x += M;
  return x;
}
void f() {
  int n;
  cin >> n;
  --n;
  vector<int> a(n);
  cin >> a;
  vector<long long> p(n + 1), q(n + 1);
  p[0] = q[0] = 1;
  for (int i = 0; i < n; ++i) {
    p[i + 1] = (p[i] * a[i]) % M;
    q[i + 1] = mod_inv(p[i + 1]);
  }
  long long inv2 = mod_inv(2);
  vector<long long> f(n + 1, 1);
  for (int k = 1; k <= 2 * n; ++k) {
    long long r = 0;
    for (int d = n; d >= 0; --d) {
      f[d] = 0;
      if (d + k <= n) {
        if ((r += p[d + k]) >= M) r -= M;
        long long x = (p[d + k] * q[d + 1]) % M;
        f[d] = (x * (a[d] - 1)) % M;
      }
      if (d > 0) {
        r = (r + p[d] * f[d - 1]) % M;
        if ((f[d] += f[d - 1]) >= M) f[d] -= M;
      }
    }
    cout << (r * inv2) % M << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  f();
  return 0;
}
