#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
    std::chrono::system_clock::time_point ttt;
    void tic() { ttt = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
    };
}
MaiScanner scanner;


// power
// x^p 対数mod
// MEMO : 逆元...powm(n,E107-2,E107)
template<typename T>
T powm(T x, T p, T mod = 1000000007ll) {
    T y = 1;
    x = x%mod;
    while (0<p) {
        if (p % 2 == 1) {
            y = (y*x) % mod;
        }
        x = (x*x) % mod;
        p /= 2;
    }
    return y;
}


// combination nCr 対数mod
template<typename T>
T combim(T n, T r, T mod = 1000000007ll) {
    T p = 1;
    for (; 0<r; r--)
        p = (((p*(n - r + 1)) % mod)*powm(r, mod - 2, mod)) % mod;
    return p;
}



int width, height;
ll m, n, kei;

ll aa[100010];

ll chk[100010];

int main() {

    scanner >> n;

    ++n;

    ll left, right;

    repeat(n) {
        int a;
        scanner >> a;
        aa[cnt] = a;
        if (!chk[a]) {
            chk[a] = cnt + 1;
        }
        else {
            left = chk[a] - 1;
            right = cnt;
        }
    }

    ll mem[100010];
    {
        ll enu = left + (n - right - 1);
        ll p = 1;
        for (ll r = 1; r <= n; ++r) {
            p = (((p*(enu - r + 1)) % MD)*powm(r, MD - 2, MD)) % MD;
            mem[r] = p;
        }

    }

    ll mem2[100010];
    {
        ll enu = n;
        ll p = 1;
        for (ll r = 1; r <= n; ++r) {
            p = (((p*(enu - r + 1)) % MD)*powm(r, MD - 2, MD)) % MD;
            mem2[r] = p;
        }

    }

    cout << n - 1 << endl;
    for (ll c = 2; c <= n; ++c) {
        ll t = mem2[c];//combim(n, c);
        ll u = mem[c - 1];// combim(left + (n - right - 1), c - 1);

                          // printf("%d %d\n",t,u);

        ll r = ((t - u) % MD + MD) % MD;
        cout << r << endl;
    }


    return 0;
}


Measured memory_bytes: 4352