#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/


#define MAX_N 100005

ll fact[MAX_N];             // N!
ll fact_inv[MAX_N];         // N!の逆元

// O(log n)でx^n(modを法とする)
ll mod_pow(ll x,ll n,ll mod){
    ll res=1;
    while(n){
        if(n&1) res = (res*x)%mod;
        x = (x*x)%mod;
        n>>=1;
    }
    return res;
}

// O(log mod)で x^-1 を計算(法をmodとする)
ll invp(ll x,ll mod){
    return mod_pow(x,mod-2,mod);
}

// 法をmodとして組み合わせ nCrを計算(O(1))
ll nCr(ll n,ll r,ll md=mod){
    if(n<r) return 0;
    ll ret = fact[n];
    ret = (ret * fact_inv[r]) % md;
    ret = (ret * fact_inv[n-r]) % md;
    return ret;
}

// 初期化 O(MAX_N * log(mod)) くらいかなぁ
void init(){
    fact[0]=1;
    for(int i=1;i<MAX_N;i++) fact[i]=(fact[i-1]*i)%mod;
    for(int i=0;i<MAX_N;i++) fact_inv[i]=invp(fact[i],mod);
}

ll n;
vector<ll> a;
ll same;

int main(){
    init();
    cin >> n;
    a.resize(n+1);
    rep(i,n+1){
        cin >> a[i];
    }

    {/*{{{*/
        set<ll> st;
        rep(i,n+1){
            if(st.count(a[i])){
                same = a[i];
                break;
            }
            st.insert(a[i]);
        }
    }/*}}}*/

    int x=0,y=0,z=0;
    {/*{{{*/
        int sta = 0;
        rep(i,n+1){
            if(a[i]==same){
                sta++;
                continue;
            }
            if(sta==0){
                x++;
            }else if(sta==1){
                y++;
            }else if(sta==2){
                z++;
            }
        }
    }/*}}}*/
    debug(same);
    debug(x);
    debug(y);
    debug(z);

    cout << n << endl;  // k==1: 
    for(int k=2;k<=n+1;k++){
        ll s = nCr(n-1,k);  // no same
        ll t = nCr(n-1,k-2);    // two same
        ll u = nCr(n-1,k-1) * 2 % mod;
        ll u_ = nCr(x+z,k-1);
        ll ans = 0;
        //if(k==n+1)
        //    cout << "k : " << k <<  " | " << s << " " << t << " " << u << " " << u_ << endl;
        ans = s+t % mod;
        ans = ans + u % mod;
        ans = ans - u_ + mod;
        ans %= mod;
        cout << ans << endl;
    }

}


Measured memory_bytes: 8192