#include <iostream>
using namespace std;

const int maxn = 1e5+1;

int main() {
    int last[maxn][10], N, digit[maxn];
    for (int i = 0; i < 10 ; ++i) {
        last[0][i] = -1;
    }

    cin>> N;
    for (int i = 0; i < N; ++i) {
        cin>> digit[N-i];
    }

    for (int i = 1; i <= N; ++i) {
        int d = digit[i];
        for (int j = 0; j <= 9; j++) {
            last[i][j] = (last[i-1][(j-d+10)%10] == -1) ? -1 : last[i-1][(j-d+10)%10]+1;
        }
        last[i][d] = 1;
    }

    for (int i = N; i > 0; --i) {
        cout<< last[i][0] <<' ';
    }
    cout<<endl;

    return 0;
}