1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef vector<PLL > VPLL;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

LL ilo(LL x) {
    if (x == 0) return 0;
    LL ans = 1;
    while (x > 0) {
        ans *= x % 10;
        x /= 10;
    }
    return ans;
}
int sym(LL x) {
    LL ans = ilo(x);
    if (ans < 10) return ans;
    return sym(ans);
}

vector<vector<vector<vector<unordered_map<LL, VLL> > > > > memo;

VLL& dp(string &p, string &s, int i, bool isLower, bool isZero, bool isHigher, LL prod) {
    //printf("dp(%d, %d, %d, %lld)\n", i, isLower, isZero, prod);
    if (memo[i][isLower][isZero][isHigher].count(prod)) return memo[i][isLower][isZero][isHigher][prod];
    if (i == s.size()) {
        VLL ans(10);
        if (isHigher) ans[sym(prod)]++;
        memo[i][isLower][isZero][isHigher][prod] = ans;
        return memo[i][isLower][isZero][isHigher][prod];
    }
    VLL ans(10);
    FOR(d, isHigher ? 0 : p[i] - '0', isLower ? 9 : s[i] - '0') {
        VLL& tmp = dp(p, s, i + 1, isLower || d < s[i] - '0', isZero && d == 0, isHigher || d > p[i] - '0', isZero && d == 0 ? prod : prod * d);
        REP(i, 10) ans[i] += tmp[i];
    }
    memo[i][isLower][isZero][isHigher][prod] = ans;
    return memo[i][isLower][isZero][isHigher][prod];
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int t; cin >> t;
    vector<pair<LL, int> > a(t + 1);
    VVLL ans(t + 1, VLL(10));
    REP(i, t) {
        cin >> a[i].ST;
        a[i].ND = i + 1;
    }
    sort(ALL(a));
    FOR(i, 1, t) {
        string s = to_string(a[i].ST);
        string p = to_string(a[i - 1].ST);
        p = string(s.size() - p.size(), '0') + p;
        memo.assign(s.size() + 1, vector<vector<vector<unordered_map<LL, VLL> > > >(2, vector<vector<unordered_map<LL, VLL> > >(2, vector<unordered_map<LL, VLL> >(2))));
        VLL& tmp = dp(p, s, 0, false, true, false, 1);
        REP(j, 10) ans[a[i].ND][j] = ans[a[i - 1].ND][j] + tmp[j];
    }
    REP(i, t) {
        REP(j, 10) cout << ans[i + 1][j] << ' ';
        cout << '\n';
    }

    return 0;
}