Problem:
Score : 600 points

Problem Statement

You are given an integer sequence of length n+1, a_1,a_2,...,a_{n+1}, which consists of the n integers 1,...,n.
It is known that each of the n integers 1,...,n appears at least once in this sequence.

For each integer k=1,...,n+1, find the number of the different subsequences (not necessarily contiguous) of the given sequence with length k, modulo 10^9+7.

Notes

If the contents of two subsequences are the same, they are not separately counted even if they originate from different positions in the original sequence.

A subsequence of a sequence a with length k is a sequence obtained by selecting k of the elements of a and arranging them without changing their relative order. For example, the sequences 1,3,5 and 1,2,3 are subsequences of 1,2,3,4,5, while 3,1,2 and 1,10,100 are not.

Constraints

1 \leq n \leq 10^5

1 \leq a_i \leq n

Each of the integers 1,...,n appears in the sequence.

n and a_i are integers.

Input

Input is given from Standard Input in the following format:

n
a_1 a_2 ... a_{n+1}

Output

Print n+1 lines.
The k-th line should contain the number of the different subsequences of the given sequence with length k, modulo 10^9+7.

Sample Input 1

3
1 2 1 3

Sample Output 1

3
5
4
1

There are three subsequences with length 1: 1 and 2 and 3.

There are five subsequences with length 2: 1,1 and 1,2 and 1,3 and 2,1 and 2,3.

There are four subsequences with length 3: 1,1,3 and 1,2,1 and 1,2,3 and 2,1,3.

There is one subsequence with length 4: 1,2,1,3.

Sample Input 2

1
1 1

Sample Output 2

1
1

There is one subsequence with length 1: 1.

There is one subsequence with length 2: 1,1.

Sample Input 3

32
29 19 7 10 26 32 27 4 11 20 2 8 16 23 5 14 6 12 17 22 18 30 28 24 15 1 25 3 13 21 19 31 9

Sample Output 3

32
525
5453
40919
237336
1107568
4272048
13884156
38567100
92561040
193536720
354817320
573166440
818809200
37158313
166803103
166803103
37158313
818809200
573166440
354817320
193536720
92561040
38567100
13884156
4272048
1107568
237336
40920
5456
528
33
1

Be sure to print the numbers modulo 10^9+7.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <string>
#define mod 1000000007


using namespace std;

long long int power(long long int n, long long int p){
	if (p == 0)
		return 1;


	if (p % 2 == 0)
		return power(n, p/2) * power(n, p/2) % mod;
	else
		return n * power(n, p-1) % mod;
}
long long int inverse(long long int n){
	return power(n, mod-2) % mod;
}


int main(void){
	long long int n;

	cin >> n;

	vector<int> a(n), b(n+1, 0);

	for (int i = 0; i < n; i++){
		cin >> a[i];
		b[a[i]]++;
	}

	int twice = 0;

	for (int i = 1; i < n+1; i++){
		if (b[i] == 2)
			twice = i;
	}

	long long int left = -1, right;

	for (int i = 0; i < n; i++){
		if (left == -1 && a[i] == twice)
			left = i;
		else if (a[i] == twice)
			right = i;
	}

	long long int mid = right - left - 1;


	long long int c1, c2, c3, c4;
	for (long long int k = 1; k <= n; k++){
		if (k == 0){
			c1 = 1;
			c2 = 0;
			c3 = 0;
			c4 = 0;
		}
		else if (k == 1){
			c1 = n-1;
			c2 = 1;
			c3 = 0;
			c4 = 1;
		}
		else if (k == 2){
			c1 = (n-1)*(n-2)/2;
			c2 = n-1;
			c3 = 1;
			c4 = n-mid-1;
		}
		else if (k > n - mid - 1){
			c1 = 0;
//			c2 *= (n-k) % mod * inverse(k) % mod;
//			c3 *= (n-k+1) % mod * inverse(k-1) % mod;
			c4 = 0;
		}
		else {
			c1 *= (n-k-1);// % mod * inverse(k+1) % mod;
//			c2 *= (n-k) % mod * inverse(k) % mod;
//			c3 *= (n-k+1) % mod * inverse(k-1) % mod;
//			c4 *= (n-k-mid) % mod * inverse(k-1) % mod;
		}

		cout << c1 + 2*c2 + c3 - c4 << endl;
	}


	cout << power(5, mod) << endl;

	cout << 1 << endl;
}