#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }
template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		this->x = x < 0 ? (x+mod)%mod : x%mod;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { cout << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; cin >> n; m = n; return is;}
typedef ModInt<1000000007> mint;


#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int main()
{
	ios_init();
	int n;
	while(cin >> n) {
		vector<int> a(n+1);
		int kaburi = -100;
		set<int> s;
		REP(i,n+1){
			cin >> a[i];
			if(s.count(a[i])){
				kaburi = a[i];
			}else{
				s.insert(a[i]);
			}
		}
		int l = -1, r = -1;
		REP(i,n+1){
			if(a[i] == kaburi) {
				if(l == -1) l = i;
				else r = i;
			}
		}
		vector<mint> conv(n);
		vector<mint> convv(n+1-(r-l+1)+1);
		conv[0] = 1;
		REP(i,n-1){
			conv[i+1] = conv[i]*(n-1-i)/(i+1);
		}
		convv[0] = 1;
		REP(i,SZ(convv)-1){
			convv[i+1] = convv[i]*(SZ(convv)-1-i)/(i+1);
		}

		auto check = [&](int x) -> bool {
			return 0 <= x and x < n;
		};
		dpite(ALL(conv));
		dpite(ALL(convv));
		FOR(k,1,n+1){
			mint ans = 0;
			if(check(k)){
				DEBUG(conv[k]);
				ans += conv[k];
			}
			DEBUG(ans);
			if(check(k-2)) ans += conv[k-2];
			DEBUG(ans);
			if(check(k-1)){
				DEBUG(conv[k-1]);
				ans += conv[k-1];
			}
			DEBUG(ans);
			if(r-l != 1 and check(k-1)){
				mint a = conv[k-1];
				mint b = 0;
				if(k-1 < SZ(convv) and k-1 >= 0) b = convv[k-1];
				DEBUG(a); DEBUG(b);
				ans += a-b;
			}
			cout << ans << endl;
		}
		cout << 1 << endl;
		// mint ans = 0;
		// ans += mint(2).pow(n-1)*2;
		// ans += mint(2).pow(n);
		// if(r-l != 0) ans += mint(2).pow(r-l-1)*mint(2).pow(n-(r-l+1));
		// cout << ans << endl;
	}
	return 0;
}


Measured memory_bytes: 7936