#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define reps(X, S, Y) for (int(X) = S; (X) < (Y); ++(X))

const ll MOD = 1e9 + 7;

ll modpow(ll r, ll n, ll m = MOD) {
  ll re = 1, d = r % m;
  if (n < 0) (n %= m - 1) += m - 1;
  for (; n; n /= 2) {
    if (n & 1) (re *= d) %= m;
    (d *= d) %= m;
  }
  return re;
}
template <int mod = MOD>
struct modInt {
  int v;
  modInt(int v = 0) : v(v) {}
  modInt operator+(const modInt &n) {
    return v + n.v < mod ? v + n.v : v + n.v - mod;
  }
  modInt operator-(const modInt &n) {
    return v - n.v < 0 ? v - n.v + mod : v - n.v;
  }
  modInt operator*(const modInt &n) { return ll(v) * n.v % mod; }
  modInt operator/(const modInt &n) {
    return ll(v) * modpow(n.v % mod, -1, mod) % mod;
  }
  template <class T>
  modInt operator+(const T &n) {
    return v + n < mod ? v + n : v + n - mod;
  }
  template <class T>
  modInt operator-(const T &n) {
    return v - n < 0 ? v - n + mod : v - n;
  }
  template <class T>
  modInt operator*(const T &n) {
    return ll(v) * (n % mod) % mod;
  }
  template <class T>
  modInt operator/(const T &n) {
    return ll(v) * modpow(n % mod, -1, mod) % mod;
  }
  modInt &operator+=(const modInt &n) {
    v += n.v;
    if (v >= mod) v -= mod;
    return *this;
  }
  modInt &operator-=(const modInt &n) {
    v -= n.v;
    if (v < 0) v += mod;
    return *this;
  }
  modInt &operator*=(const modInt &n) {
    v = ll(v) * n.v % mod;
    return *this;
  }
  modInt &operator/=(const modInt &n) {
    v = ll(v) * modpow(n.v, -1, mod) % mod;
    return *this;
  }
  template <class T>
  modInt &operator+=(const T &n) {
    v += n;
    if (v >= mod) v -= mod;
    return *this;
  }
  template <class T>
  modInt &operator-=(const T &n) {
    v -= n;
    if (v < 0) v += mod;
    return *this;
  }
  template <class T>
  modInt &operator*=(const T &n) {
    v = ll(v) * n % mod;
    return *this;
  }
  template <class T>
  modInt &operator/=(const T &n) {
    v = ll(v) * modpow(n, -1, mod) % mod;
    return *this;
  }
};
template <int mod>
ostream &operator<<(ostream &os, const modInt<mod> &n) {
  return os << n.v;
};
template <class T, int mod>
modInt<mod> operator+(const T &n, const modInt<mod> &m) {
  return m.v + n < mod ? m.v + n : m.v + n - mod;
}
template <class T, int mod>
modInt<mod> operator-(const T &n, const modInt<mod> &m) {
  return n - m.v < 0 ? n - m.v + mod : n - m.v;
}
template <class T, int mod>
modInt<mod> operator*(const T &n, const modInt<mod> &m) {
  return ll(m.v) * (n % mod) % mod;
}
template <class T, int mod>
modInt<mod> operator/(const T &n, const modInt<mod> &m) {
  return ll(m.v) * modpow(n % mod, -1, mod) % mod;
}
typedef modInt<MOD> mint;
template <int mod>
modInt<mod> modpow(modInt<mod> r, ll n) {
  modInt<mod> re(1);
  if (n < 0) (n %= mod - 1) += mod - 1;
  for (; n; n /= 2) {
    if (n & 1) re *= r;
    r *= r;
  }
  return re;
}
vector<mint> fact, finv, inv;
mint comb(ll n, ll r) {
  if (n < r || r < 0) return 0;
  return fact[n] * finv[n - r] * finv[r];
}
class CombInit {
  void Modinvs(vector<mint> &re, int n) {
    re.resize(n + 1);
    re[1] = 1;
    for (int i = 2; i <= n; ++i) re[i] = re[MOD % i] * (MOD - MOD / i);
  }
  void Facts(vector<mint> &re, int n) {
    re.resize(n + 1);
    re[0] = 1;
    rep(i, n) re[i + 1] = re[i] * (i + 1);
  }
  void Factinvs(vector<mint> &re, const vector<mint> &inv, int n) {
    re.resize(n + 1);
    re[0] = 1;
    rep(i, n) re[i + 1] = re[i] * inv[i + 1];
  }

 public:
  CombInit(int n) {
    Modinvs(inv, n);
    Facts(fact, n);
    Factinvs(finv, inv, n);
  }
} combInit(212345);

int main() {
  int n;
  cin >> n;
  ++n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  vector<int> ind(n, -1);
  int l, r;
  rep(i, n) {
    if (ind[a[i]] >= 0) {
      l = ind[a[i]];
      r = i;
      break;
    } else
      ind[a[i]] = i;
  }
  reps(i, 1, n + 1) { cout << comb(n, i) - comb(l + n - 1 - r, i - 1) << endl; }
  return 0;
}


Measured memory_bytes: 4480