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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static interface ICommon {
		public static final int BASE_DEF = 1000000007;
		public static final int CAPACITY = 100000;
	}
	
	//-------------------------------------------------------------------------
	public static abstract class CalcUtil implements Comparable<CalcUtil>, ICommon {
		protected ModInt modInt = null;
		
		public int n;
		public int r;
		public int mod;
		
		protected CalcUtil (int v1, int v2, int m) {
			n = v1;
			r = v2;
			mod = m;
			modInt = ModInt.getInstance(m,CAPACITY);
			init(CAPACITY);
		}
		
		protected void init(int cap) {}
		protected boolean containsKey() {return false;}
		protected int get() {return -1;}
		
		protected static int getCalcResult(CalcUtil c) {
			if(c.containsKey()) {
				return c.get();
			} else {
				return c.calc();
			}
		}

		@Override
		public int compareTo(CalcUtil c) {
			int ret = Integer.compare(n, c.n);
			if (ret == 0) {
				ret = Integer.compare(r, c.r);
				if (ret == 0) {
					ret = Integer.compare(mod, c.mod);
				}
			}
			return ret;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + mod;
			result = prime * result + n;
			result = prime * result + r;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			CalcUtil other = (CalcUtil) obj;
			if (mod != other.mod)
				return false;
			if (n != other.n)
				return false;
			if (r != other.r)
				return false;
			return true;
		}

		protected abstract int calc() ;
		
	}
	//-------------------------------------------------------------------------

	public static class FUtil extends CalcUtil {
		private static int[] Farray = null;;
		private static int[] FInvarray = null;;
		private static long instanceCounter=0;
		
		public static int getF(int n, int m) {
			return getCalcResult(new FUtil(n, m));
		}

		public static int getFInv(int n) {
			return FInvarray[n];
		}
		
		public FUtil(int n, int m) {
			super(n, n, m);
			FUtil.instanceCounter++;
		}

		protected void init(int cap) {
			if(Farray != null) return;
			Farray = new int[cap+1];
			FInvarray = new int[cap+1];
			for(int n=0; n<Farray.length; n++) {
				Farray[n] = (n==0) ? 1 : modInt.multiple(n, Farray[n-1]);
				FInvarray[n] = modInt.divide(1, Farray[n]);
			}
		}
		
		protected int calc() {
			if(n < 0) throw new IllegalArgumentException("value=" +n);
			if(n == 0) return 1;
			if(n < Farray.length) return Farray[n];
			int ret = Farray[Farray.length - 1];
			for (int i=Farray.length; i<=n; i++) {
				ret = modInt.multiple(ret, i);
			}
			return ret;
		}

		@Override
		protected boolean containsKey() {
			return (n<Farray.length);
		}

		@Override
		protected int get() {
			return Farray[n];
		}
	}
	//-------------------------------------------------------------------------

	public static class PUtil extends CalcUtil {
		protected static Map<CalcUtil,Integer> calcResultMap = new HashMap<CalcUtil,Integer>();
		private static long instanceCounter=0;
		
		public static int getP(int n, int r, int m) {
			return new PUtil(n, r, m).calc();
		}
		
		public PUtil(int n, int r, int m) {
			super(n, r, m);
			PUtil.instanceCounter++;
		}
		protected int calc() {
			if ( n < 0 || r < 0 || n < r ) throw new IllegalArgumentException("n=" +n+ ",r=" +r);
			if ( n <= 1 || r == 0) return 1;
			if ( r == 1 ) return n;
			return modInt.divide(FUtil.getF(n, mod), FUtil.getF(n-r, mod));
			
		}
	}
	//-------------------------------------------------------------------------

	public static class CUtil extends CalcUtil {
		protected static Map<CalcUtil,Integer> calcResultMap = new HashMap<CalcUtil,Integer>();
		private static long instanceCounter=0;

		public static int getC(int n, int r, int m) {
			return new CUtil(n, r, m).calc();
		}
		
		public static int getH(int n, int r, int m) {
			return new CUtil(n+r-1, r, m).calc();
		}
		
		public CUtil(int n, int r, int m) {
			super(n, r, m);
			CUtil.instanceCounter++;
		}
		protected int calc() {
			if(n < 0 || r < 0 || n < r) throw new IllegalArgumentException("n=" +n+ ",r=" +r);
			if(n == 0 || n == 1) return 1;
			if(n - r < r) r = n - r;
			return modInt.divide(PUtil.getP(n,r,mod), FUtil.getF(r, mod));
		}
	}
	//-------------------------------------------------------------------------
	public static class ModInt implements Cloneable, ICommon {
		private static long instanceCounter=0;
		private static Map<Integer,ModInt> instance = new HashMap<Integer,ModInt>();
		public static ModInt getInstance(int mod, int cap) {
			if(instance.containsKey(mod)){ 
				return instance.get(mod);
			} else {
				ModInt mi = new ModInt(mod,cap);
				instance.put(mod, mi);
				return mi;
			}
		}
		
		private int mod = BASE_DEF;
		private int capacity = CAPACITY;

		private ModInt(int m) {
			mod = m;
		}
		private ModInt(int m, int cap) {
			this(m);
			capacity=cap;
		}
		
		
		public int modulo(long v) {
			return (int)(v%mod);
		}
		
		public int add(int a, int b) {
			return modulo(a + b);
		}
		
		public int sub(int a, int b) {
			return add(a, mod - b);
		}
		
		public int multiple(int a, int b) {
			return modulo((long)a * modulo(b));
		}
		
		public int divideF(int a, int fn) {
			if(fn<=capacity) {
				return multiple(a, FUtil.getFInv(fn));
			}else{
				return divide(a, FUtil.getF(fn, mod));
			}
		}
		
		public int divide(int a, int b) {
			return multiple(a, power(b, mod-2));
		}

		public int power(int a, int b) {
			int ret = 1;
			for (int bitMask = 1; bitMask<=b; bitMask<<=1) {
				if ( (b & bitMask) != 0 ) ret = multiple(ret, a);
				a = multiple(a, a);
			}
			return ret;
		}
	}
	
	//-------------------------------------------------------------------------
	private int mod = ICommon.BASE_DEF;
	private ModInt modInt = null;
	public Main() {
		modInt = ModInt.getInstance(mod,ICommon.CAPACITY);
	}

	public void exec() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] a = new int[n+1];
		for(int i=0; i<a.length; i++) {
			a[i] = scan.nextInt();
		}
		int[] search = new int[n+1];
		int l=0;
		int r=0;
		Arrays.fill(search, 0);
		for (int i=0; i<n+1; i++) {
			if(search[a[i]-1] != 0) {
				l = search[a[i]-1];
				r = i+1;
				break;
			} 
			else search[a[i]-1] = i+1;
		}
		PrintWriter out = new PrintWriter(System.out);
		
		for (int k=1; k<=n+1; k++) {
			int full = CUtil.getC(n+1, k, mod);
			int duplicate = 0;
			if (l-1+n+1-r >= k-1) {
				duplicate = CUtil.getC(l-1+n+1-r,k-1, mod);
			}
			out.println(modInt.sub(full,duplicate));
			
		}
		out.flush();
		scan.close();
	}

	public static void main(String[] args) {
		new Main().exec();

	}
}