#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N;
    cin >> N;
    int nums[N];
    int sum[N];
    for (int i = 0; i < N; i++)
    {
        cin >> nums[i];
        if(i > 0) {
        sum[i] = (nums[i] + sum[i-1]) % 10;
        }
        else {
            sum[i] = nums[i];
        }
    }

    vector<queue<int>> classes;
    for (int i = 0; i < 10; i++) {
        classes.push_back(queue<int>());
    }
    classes[0].push(-1);

    int result[N];

    for (int i = 0; i < N; i++)
    {
        classes[sum[i]].push(i);
        if(nums[i] == 0) {
            result[i] = 1;
        }
        else {
            result[i] = -1;
        }
    }

    for (int c = 0; c < 10; c++)
    {
        while(classes[c].size() >= 2) {
            int start = classes[c].front();
            classes[c].pop();
            int end = classes[c].front();
            result[start + 1] = end - start;
        }
    }

    for (int i = 0; i < N; i++)
    {
        cout << result[i] << " ";
    }

    cout << endl;

    return 0;
}