using System;
using System.Collections.Generic;
using System.Text;

namespace AtTest.D_Challenge
{
    class ABC_066
    {
        static void Main(string[] args)
        {
            Method(args);
            Console.ReadLine();
        }

        static void Method(string[] args)
        {
            int n = ReadInt();
            long[] array = ReadLongs();
            long mask = 1000000000 + 7;
            var cnts = new long[n];
            long extCnt = 0;
            var doubleDict = new Dictionary<long, int>();
            for(int i = 0; i < n; i++)
            {
                if (doubleDict.ContainsKey(array[i]))
                {
                    extCnt = doubleDict[array[i]] + (n - i);
                    break;
                }
                else
                {
                    doubleDict.Add(array[i], i);
                }
            }

            var perms = new long[n+2];
            perms[0] = 1;
            for(long i = 1; i <= n+1; i++)
            {
                perms[i] = perms[i - 1] * i;
                perms[i] %= mask;
            }

            for(int i=1;i<=n;i++)
            {
                long val = MultiMod(perms[n+1], 
                    ReverseMod(perms[n+1 - i], mask - 2, mask), mask);
                val = MultiMod(val,
                    ReverseMod(perms[i], mask - 2, mask), mask);
                //Console.WriteLine(val);
                long remain = i - 1;
                if (remain < extCnt)
                {
                    long minus = MultiMod(perms[extCnt],
                    ReverseMod(perms[extCnt - remain], mask - 2, mask), mask);
                    minus = MultiMod(minus,
                        ReverseMod(perms[remain], mask - 2, mask), mask);
                    val -= minus;
                }
                else if (remain == extCnt) val--;

                if (val < 0) val += mask;
                Console.WriteLine(val);
            }
            Console.WriteLine(1);
        }

        static long Combination(long n, long m, long mask)
        {
            if (n - m < m) m = n - m;

            long val = Permutation(n, m, mask);
            long div = Permutation(m, m, mask);
            return MultiMod(val, ReverseMod(div, mask - 2, mask), mask);
        }

        static long Permutation(long n, long m, long mask)
        {
            long val = 1;
            for (long i = 0; i < m; i++)
            {
                val *= ((n - i) % mask);
                val %= mask;
            }
            return val;
        }

        static long MultiMod(long a, long b, long mask)
        {
            return ((a % mask) * (b % mask)) % mask;
        }

        static long ReverseMod(long a, long pow, long mask)
        {
            if (pow == 0) return 1;
            else if (pow == 1) return a % mask;
            else
            {
                long halfMod = ReverseMod(a, pow / 2, mask);
                long nextMod = MultiMod(halfMod, halfMod, mask);
                if (pow % 2 == 0)
                {
                    return nextMod;
                }
                else
                {
                    return MultiMod(nextMod, a, mask);
                }
            }
        }

        private static string Read() { return Console.ReadLine(); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }
    }
}


Measured memory_bytes: 34524