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.

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.

Examples

Input

3
1 2 1 3


Output

3
5
4
1


Input

1
1 1


Output

1
1


Input

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


Output

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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.Map.Entry;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			long[] a = in.nextLongArray(n+1);
			long sum = 0;

			Map<Long, Integer> map = new HashMap<>();
			for (int i = 0; i < n+1; i++) {
				map.merge(a[i], 1, Integer::sum);
			}

			long b = -1;
			for (Entry<Long, Integer> e : map.entrySet()) {
				if (e.getValue() == 2) {
					b = e.getKey();
					break;
				}
			}

			int l = INF, r = -INF;
			for (int i = 0; i < n+1; i++) {
				if (a[i] == b) {
					l = Math.min(l, i);
					r = Math.max(r, i);
				}
			}

			int adj = n-r+l;

			for (int k = 1; k <= n+1; k++) {
				sum = 0;
				sum += comb(n+1, k);
				if (k == 1) {
					sum--;
				} else if (adj >= k-1) {
					sum = (sum + MOD - comb(adj, k-1)) % MOD;
				}
				out.println(sum);
			}

		}

		/**
		 * 二項係数
		 * 前提 n < modP
		 * nCr = n!/(r!*(n-r)!)である。この時分子分母にMODが来る場合は以下のように使用する
		 * */
		public static long comb(int n, int r) {
			return fact[n] * factInv[r] % MOD * factInv[n - r] % MOD;
		}

		/**
		 * 階乗数の逆元
		 *
		 * */
		public static int MAXN = 200000;
		public static long MOD = 1000000007;

		static long[] fact = factorialArray(MAXN, MOD);
		static long[] factInv = factorialInverseArray(MAXN, MOD,
				inverseArray(MAXN, MOD));

		// 階乗の mod P テーブル
		public static long[] factorialArray(int maxN, long mod) {
			long[] fact = new long[maxN + 1];
			fact[0] = 1 % mod;
			for (int i = 1; i <= maxN; i++) {
				fact[i] = fact[i - 1] * i % mod;
			}
			return fact;
		}

		// 数 i に対する mod P での逆元テーブル
		public static long[] inverseArray(int maxN, long modP) {
			long[] inv = new long[maxN + 1];
			inv[1] = 1;
			for (int i = 2; i <= maxN; i++) {
				inv[i] = modP - (modP / i) * inv[(int) (modP % i)] % modP;
			}
			return inv;
		}

		// 階乗の逆元テーブル
		public static long[] factorialInverseArray(int maxN, long modP,
				long[] inverseArray) {
			long[] factInv = new long[maxN + 1];
			factInv[0] = 1;
			for (int i = 1; i <= maxN; i++) {
				factInv[i] = factInv[i - 1] * inverseArray[i] % modP;
			}
			return factInv;
		}

	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}
