#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;#define P 1000003
int n, c[1005][1005], sum[40], a, ans[1005], t;
// c[][]记录杨辉三角形
// sum[]记录每位上有多少个1；
// ans[]记录第k天有多少种方案
int main()
{
// 杨辉三角形打表，记录C(m,n)
    for (int i =0; i <= 1000; i++)
    {
        c[i][0] = 1;
        c[i][i] = 1;
    }
    for (int i =1; i <= 1000; i++)
    {
        for (int j = 1; j < i; j++)
        {
            c[i][j] = (c[i - 1][j] % P + c[i-1][j-1] %P) %P;
        }
    }
    while (~scanf("%d", &n))
    {
        memset(sum, 0, sizeof(sum));
        memset(ans, 0, sizeof(ans));
　　　　// 将每位上有多少个1记录下来
        for (int i= 0; i < n; i++)
        {
            int t;
            scanf("%d", &t);
            for (int j = 0; t;++j,t>>=1)
            {
                if (t%2) sum[j]++; //该位上有1；
            }
        }
            for (int k = 1; k <= n; k++)
            {
                for (int i = 0; i < 32; i++)
                {

                    for (int j = 1; j <= sum[i] && j <= k; j += 2){
                        t = (long long )c[sum[i]][j]* c[n-sum[i]][k-j] %P*(1<<i)%P;
                        ans[k] = (ans[k] + t) % P;
                    }

                }

            }


        for (int k = 1; k <= n; k++)
                printf("%d%c", ans[k], k < n?‘ ‘:‘\n‘);
    }
}