#include <iostream>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <cstdlib>

#include <ctime>

#include <string>

#define CL(a,b) memset(a,b,sizeof(a))

#define INF 0x3fffffff

#define MID int mid=(l+r)>>1;

#define ll __int64

using namespace std;

const ll mod=;

ll power(ll a,ll b)

{

    if(b==)return ;

    if(b==)return a;

    ll rem=power(a,b/);

    rem=(rem*rem)%mod;

    if(b%==)

    {

        rem*=a;

        rem%=mod;

    }

    return rem%mod;

}

ll ni(ll x)

{

    return power(x,mod-);

}

ll C[][];

void initc()

{

    int i,j;

    for(i=;i<=;i++)

    {

        C[i][]=;

    }

    for(i=;i<=;i++)

    {

        for(j=;j<=i;j++)

        {

            C[i][j]=C[i][j-]*(i-j+)*ni(j);

            C[i][j]%=mod;

        }

    }

}

ll val[];

int sum[];

void initval()

{

    int i;

    val[]=;

    for(i=;i<;i++)

    {

        val[i]=val[i-]*;

        val[i]=val[i]%mod;

    }

}

int main()

{

    int n,m;

    initc();

    initval();

    while(scanf("%d",&n)!=EOF)

    {

        int i,j,maj=,k;

        CL(sum,);

        ll rem,a;

        for(i=;i<n;i++)

        {

            scanf("%I64d",&a);

            j=;

            while(a)

            {

                sum[j]+=a%;

                a/=;

                j++;

            }

            if(maj<j-)maj=j-;

        }

        for(i=;i<=n;i++)

        {

            rem=;

            for(j=;j<=maj;j++)

            {

                for(k=;k<=i;k+=)

                {

                    if(!(k<=sum[j]&&i-k<=n-sum[j]))continue;

                    rem+=(val[j]*C[sum[j]][k]*C[n-sum[j]][i-k])%mod;

                    rem=rem%mod;

                }

            }

            if(i!=)printf(" ");

            printf("%I64d",rem);

        }

        printf("\n");

    }

    return ;

}