#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<array>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cassert>
#include<functional>
#include<random>
#include<complex>
#include<bitset>
#include<chrono>
#include<boost/multiprecision/cpp_int.hpp>
#define int int64_t
#define uint uint64_t
#define REP(i, a, b) for (int64_t i = (int64_t)(a); i < (int64_t)(b); i++)
#define rep(i, a) REP(i, 0, a)
#define EACH(i, a) for (auto i: a)
#define ITR(x, a) for (auto x = a.begin(); x != a.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define HAS(a, x) (a.find(x) != a.end())
#define Min(x) *min_element(ALL(x))
#define Max(x) *max_element(ALL(x))
#define Unique(L) (L.erase(unique(ALL(L)), L.end()))
#define veccat(v1, v2) std::copy((v2).begin(),(v2).end(),std::back_inserter(v1)/*v1の後ろにv2を入れる*/)
#define intmax (std::numeric_limits<int64_t>::max() / 4)
using namespace std;
typedef boost::multiprecision::cpp_int bigint;
const double EPS = 1e-9;
const double PI = acos(-1.0);


class modint {
	//MODが素数であることを前提として実装してあるが、その判定はしていない。
	//あまりが出るような除算をしてはいけない。
private:
	static const int MOD = 1000000007;
public:
	modint() {
		//assert(is_prime(MOD));
		this->number = 0;
	}
	modint(const int src) {
		//assert(is_prime(MOD));
		this->number = opposit(src);
	}
	modint(const modint &src) {
		this->number = src.number;
	}

	modint& operator += (const modint& obj) {
		this->number = san2(this->number + obj.number);
		return *this;
	}
	modint& operator -= (const modint& obj) {
		this->number = san2(this->number - obj.number + MOD);
		return *this;
	}
	modint& operator *= (const modint& obj) {
		this->number = (this->number * obj.number) % MOD;
		return *this;
	}
	modint& operator /= (const modint& obj) {
		this->number = (this->number * inverse(obj.number)) % MOD;
		return *this;
	}
	modint& operator += (const int n) {
		this->number = san2(this->number + opposit(n));
		return *this;
	}
	modint& operator -= (const int n) {
		this->number = san2(this->number - opposit(n) + MOD);
		return *this;
	}
	modint& operator *= (const int n) {
		this->number = (this->number * opposit(n)) % MOD;
		return *this;
	}
	modint& operator /= (const int n) {
		this->number = (this->number * inverse(n)) % MOD;
		return *this;
	}

	modint operator + (const modint obj) { modint re(*this); return re += obj; }
	modint operator - (const modint obj) { modint re(*this); return re -= obj; }
	modint operator * (const modint obj) { modint re(*this); return re *= obj; }
	modint operator / (const modint obj) { modint re(*this); return re /= obj; }
	modint operator + (const int n) { modint re(*this); return re += n; }
	modint operator - (const int n) { modint re(*this); return re -= n; }
	modint operator * (const int n) { modint re(*this); return re *= n; }
	modint operator / (const int n) { modint re(*this); return re /= n; }

	modint operator = (const int n) {
		this->number = opposit(n);
		return *this;
	}
	int get() {
		return number;
	}

private:
	int number;

	int opposit(int n) {
		if (n < 0)n = MOD - ((-n) % MOD);
		return n % MOD;
	}
	int inverse(int n) {
		n = opposit(n);
		int result = 1;
		for (int i = MOD - 2; i; i /= 2) {
			if (i % 2)result = (result * n) % MOD;
			n = (n * n) % MOD;
		}
		return result;
	}
	inline int san2(const int n) {
		return MOD <= n ? n - MOD : n;
	}
	bool is_prime(int n) {
		if (n <= 1)return false;
		if (n == 2)return true;
		if (n % 2 == 0) return false;
		const int upperbound = int(sqrt(n));
		for (int i = 3; i <= upperbound; i += 2) {
			if (n % i == 0) return false;
		}
		return true;
	}
};
struct combi {
public:
	vector<modint>facto;
	combi(const int N) :facto(N) {
		facto[0] = 1;
		REP(i, 1, N)facto[i] = facto[i - 1] * i;
	}
	modint get_combi(const int N, const int C) {
		//combination(N+C,C)を求めて返す。
		if (int(facto.size()) <= N + C) {
			int a = facto.size();
			facto.resize(N + C + 1);
			REP(i, a, N + C + 1)facto[i] = facto[i - 1] * i;
		}
		return facto[N + C] / (facto[N] * facto[C]);
	}
};


signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;
	vector<int>a(n + 1);
	rep(i, n + 1)cin >> a[i];

	combi C(100001);

	vector<pair<int, int>>b(n + 1);
	rep(i, n + 1)b[i] = make_pair(a[i], i);
	sort(ALL(b));
	int d1, d2;
	rep(i, n)if (b[i].first == b[i + 1].first) {
		d1 = b[i].second;
		d2 = b[i + 1].second;
	}

	cout << n << endl;

	for (int k = 2; k <= n; k++) {
		modint ans = 0;

		//d1とd2を両方選ぶ:Combination(n-1,k-2)
		if (n - 1 - (k - 2) >= 0)ans += C.get_combi(n-1-(k-2),k-2);

		//d1を選ぶがd2を選ばない:Combination(n-1,k-1)
		if (n - 1 - (k - 1) >= 0)ans += C.get_combi(n - 1 - (k - 1), k - 1);

		//d2を選ぶがd1を選ばない:Combination(n-1,k-1)
		if (n - 1 - (k - 1) >= 0)ans += C.get_combi(n - 1 - (k - 1), k - 1);

		//d1もd2も選ばない:Combination(n-1,k)
		if(n - 1 - (k) >= 0)ans += C.get_combi(n - 1 - (k), k);

		//包除原理
		int L = d1;
		int R = n - d2;
		if (L + R - (k - 1) >= 0)ans -= C.get_combi(L+R - (k - 1), k - 1);
		cout << ans.get() << endl;
	}

	cout << 1 << endl;



	return 0;
}





Measured memory_bytes: 4352