#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1e9 + 7, N = 2e5;

int n;
int last[10], a[N], ans[N];

int main()
{
    ios::sync_with_stdio(0);
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    int sum = 0;

    for (int i = 0; i < 10; i++) {
        last[i] = -1;
    }

    last[0] = n;

    for (int i = n - 1; i >= 0; i--) {
        sum += a[i];

        if (last[sum % 10] == -1) {
            ans[i] = -1;
        } else {
            ans[i] = last[sum % 10] - i;
        }

        last[sum % 10] = i;
    }

    for (int i = 0; i < n; i++) {
        cout << ans[i] << ' ';
    }

    return 0;
}