2
0 1
 1
0

1
2
 1

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <array>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }


template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif
// #include "../l/mod.h"
using namespace std;

template <typename T, int Degree>
class Poly {
public:
    Poly() : X({0}) {}
    Poly(std::initializer_list<T> x) : X({0}) {
        int i = 0;
        for (auto it = x.begin(); it != x.end(); ++it, ++i) X[i] = *it;
    }

    Poly& operator+=(const Poly&b) {
        for (int i = 0; i < Degree; ++i) X[i] += b.X[i];
        return *this;
    }

    Poly& operator*=(const Poly&b) {
        Poly c;
        for(int i=0;i<Degree;++i)
            for(int j=0;j<Degree;++j)
                c.X[(i+j)%Degree]+=X[i]*b.X[j];
        return *this = c;
    }

    Poly operator*(const Poly&b) const {
        return Poly{*this} *= b;
    }

    template <int S>
    Poly& operator%=(const Poly<T,S>&b) {
        int q = S-1;
        while (b.X[q] == 0) --q;
        for (int i = Degree-1; i >= q; --i) {
            auto d = X[i] / b.X[q];
            for (int j = 0; j <= q; ++j) X[i-j] -= d * b.X[q-j];
        }
        return *this;
    }

    Poly& operator^=(ull p) {
        Poly a = *this;
        Poly c = {1};
        for (;p; a *= a, p /= 2) if(p&1) c *=a;
        return *this = c;
    }

    T& operator[](int x) {
        return X[x];
    }

    void print(ostream&os) const {
        bool first = true;
        for (int i = 0; i < Degree; ++i) {
            if (X[i]) {
                if (X[i] < numeric_limits<T>::max()/2) {
                    if (i == 0 || X[i] != 1) {
                        if (!first) os << '+';
                        os << X[i];
                    }
                } else {
                    if (i == 0 || (ll)X[i] != -1) os << (ll)X[i];
                    else os << '-';
                }

                if (i != 0) {
                    os << 'x';
                    if (i >= 2) {
                        os << '^' << i;
                    }
                }
                first = false;
            }
        }
    }

private:
    array<T, Degree> X;
};

template <typename T, int D>
ostream& operator<<(ostream&os, const Poly<T,D>&p) {
    p.print(os);
    return os;
}

constexpr ull pw(ull a,ull b){
    ull c=1;
    for(;b;a*=a,b/=2) if(b&1)c*=a;
    return c;
}

constexpr int B=10;
constexpr int SZ=5;
constexpr int LG=5;
constexpr int MX=100000; // pow(B, LG)
constexpr ull MOD=(1LL<<58);

using PPP = Poly<ull, SZ>;

constexpr int pws[] = {1, 10, 100, 1000, 10000, 100000};

class ERadixSum {
public:
    using arr=array<PPP, MX>;
    using smarr=array<PPP, B>;

    PPP rts[B][B];
    PPP rts1[B][B];

    void initrts() {
        PPP root = {0,1}; // x

        PPP cur = {1};
        for (int i = 0; i < B; ++i, cur *= root) {
            PPP x = {1};
            for (auto &r: rts[i]) {
                r = x;
                x *= cur;
            }
        }

        root = {0,0,0,0,(ull)-1};  // x^{-4}
        cur = {1};
        for (int i = 0; i < B; ++i, cur *= root) {
            PPP x = {1};
            for (auto &r: rts1[i]) {
                r = x;
                x *= cur;
            }
        }
    }

    inline smarr dft(smarr x, bool inv) {
        smarr ans;
        for (int i = 0; i < B; ++i) {
            for (int j = 0; j < B; ++j) {
                ans[i] += (inv ? rts[i][j] : rts1[i][j]) * x[j];
            }
        }
        return ans;
    }

    void hadamard(arr &a, bool inv) {
        for (int i = 0; i < LG; ++i) {
            for (int j = 0; j < MX; ++j) {
                if (j % pws[i + 1] / pws[i] == 0) {

                    smarr A;
                    for (int k = 0; k < B; ++k) A[k] = a[j + pws[i] * k];
                    A = dft(A, inv);
                    for (int k = 0; k < B; ++k) a[j + pws[i] * k] = A[k];
                }
            }
        }
    }

    void solve(istream& cin, ostream& cout) {
        initrts();

        int N;
        cin >> N;
        arr A;
        fill(A.begin(),A.end(),PPP{0});

        for (int i = 0; i < N; ++i) {
            int x;
            cin >> x;
            ++A[x][0];
        }
        hadamard(A, false);
        for (auto&a: A) a ^= N;
        hadamard(A, true);

        ull inv = pw(5, (1ULL<<63)-1);
        inv = pw(inv,LG);
        PPP cyclo = {1,(ull)-1,1,(ull)-1,1};
        for(int i = 0; i < N;++i) {
            A[i] %= cyclo;
            A[i][0] >>= LG;
            A[i][0] *= inv;
            cout<<A[i][0]%MOD<<'\n';
        }
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	ERadixSum solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}
