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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.Map;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        D11 solver = new D11();
        solver.solve(1, in, out);
        out.close();
    }

    static class D11 {
        static final int mod = (int) 1e9 + 7;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int[] arr = in.nextIntArray(n + 1);
            int diff = 0;
            Map<Integer, Integer> map = new HashMap<>();
            for (int i = 0; i < n + 1; i++) {
                if (map.containsKey(arr[i])) {
                    diff = (i - map.get(arr[i])) + 1;
                    break;
                } else map.put(arr[i], i);
            }
            ModUtils modUtils = new ModUtils(mod, 100001);
            for (int k = 1; k <= n + 1; k++) {
                int total = modUtils.getC(n + 1, k);
                int duplicate = 0;
                if (n + 1 - diff >= k - 1) {
                    duplicate = modUtils.getC(n + 1 - diff, k - 1);
                }
                out.println(modUtils.sub(total, duplicate));
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class ModUtils {
        public static final int BASE_DEF = 1000000007;
        public static final int CAPACITY_F = 100001;
        protected int mod = BASE_DEF;
        protected int capacity = CAPACITY_F;
        private int[] Farray = null;
        private int[] FInvarray = null;

        public ModUtils() {
            initF();
        }

        public ModUtils(int m, int cap) {
            mod = m;
            capacity = cap;
            initF();
        }

        protected void initF() {
            if (Farray != null) return;
            Farray = new int[capacity + 1];
            FInvarray = new int[capacity + 1];
            for (int n = 0; n < Farray.length; n++) {
                Farray[n] = (n == 0) ? 1 : multiple(n, Farray[n - 1]);
                FInvarray[n] = divide(1, Farray[n]);
            }
        }

        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 divide(int a, int b) {
            return multiple(a, power(b, mod - 2));
        }

        public int divideF(int a, int fn) {
            if (fn <= capacity) {
                return multiple(a, getFInv(fn));
            } else {
                return divide(a, getF(fn));
            }
        }

        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;
        }

        public int getF(int n) {
            return Farray[n];
        }

        public int getFInv(int n) {
            return FInvarray[n];
        }

        protected int calcC(int n, int r) {
            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 divideF(divideF(getF(n), r), n - r);
        }

        public int getC(int n, int r) {
            return calcC(n, r);
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }
}

