#include<bits/stdc++.h>
using namespace std;
//type
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
//x * y * 1.0 can cause overflow
//constant
#define inf (int)(1e9+7)
#define mod (ll)(1e9+7)
#define eps 1e-10
//omission
#define eb emplace_back
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios cin.tie(0); ios::sync_with_stdio(false)
#define FIX(a) cout << fixed << setprecision(a)
//loop
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep3(i, st, n) for (int i = st; i < n; ++i)
//manip
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end(), v.end());
#define fill(x, y) memset(x, y, sizeof(x))
#define ceil(a, b) a / b + !!(a % b)
template<class T> T power_mod(T a, T b) {return b ? power_mod(a * a % inf, b / 2) * (b % 2 ? a : 1) % inf : 1;}
template<class T> T power(T a, T b) {return b ? power(a * a, b / 2) * (b % 2 ? a : 1) : 1;}
#define LB(v, x) (int)(lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (int)(upper_bound(v.begin(), v.end(), x) - v.begin())
template<typename T> T gcd(T a, T b) {if (b == 0) return a; return gcd(b, a % b);}
template<typename T> T lcm(T a, T b) {return a / gcd(max(a, b), min(a, b)) * b;} //先に割る!!
#define outa(a, n) rep(i, n) cout << a[i] << " "; cout << endl
#define outaa(a, m, n) rep(i, m) {rep(j, n) cout << a[i][j] << " "; cout << endl;} cout << endl
#define out(a) cout << a << endl
#define outv(v) rep(i, SZ(v)) cout << v[i] << " "; cout << endl

//algorithm
//double pointer, l start, how many adds, can be 0 -> init r = l, sum = 0
//bfs, not x, y, i, j
//not !(i % 2), i % 2 == 0
//minimal required terms
//cast caution
//look constraints always


const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long nck(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}



int main() {
    
    COMinit();
    int n; cin >> n;
    //n = 1000;
    if (n == 1) {
        out(1); out(1);
        return 0;
    }
    int l, r;
    int table[100001]; fill_n(table, 100001, -1);
    rep(i, n + 1) { //n + 1!!
        int a; cin >> a;
        if (table[a] != -1) {r = i; l = table[a];}
        table[a] = i;
        
    }
    //cout << l << " " << r << endl;
    out(n); //下で、「aを2つとる場合」とかで場合分けしてる 2つ以上ないと
    rep3(k, 2, n + 2) {
        ll ans = 0;
        
        //2個出現する数をaとする
        //aを1つも取らない場合
        (ans += nck(n + 1 - 2, k)) %= mod;
        
        //aを2つともとる場合
        (ans += nck(n + 1 - 2, k - 2)) %= mod;
        //out(n - 1 << " " << k - 2);
        //out("k " << ans);
        
        
        //aを1つとる場合
        //a...a区間の数とらない
        ll tmp = nck(n + 1 - 2 - (r - l - 1), k - 1);
        
        (ans += tmp) %= mod;
        
        // out(ans);
        //とる
        //aを1つとり、a...a区間からとるかどうでもいい場合の数 - tmp
        (ans += 2 * (nck(n - 1, k - 1) - tmp)) %= mod;
        
        out((ans + mod) % mod);
    }
    
    
}



Measured memory_bytes: 13568