#include <bits/stdc++.h>
#define ll long long
#define FOR(i, n) for(ll i = 0; i < n; i++)
#define MOD 1000000007
#define D 8

using namespace std;


template<typename T>
ostream& operator<<(ostream &out, vector<T> cont)
{
    for(auto it = cont.begin(); it != cont.end(); it++)
        out << *it << (it != cont.end()-1 ? ' ' : '\n');
    return out;
}

template<typename T>
ostream& operator<<(ostream &out, vector<vector<T>> cont)
{
    for(auto it = cont.begin(); it != cont.end(); it++)
        out << *it;
    return out;
}

ll mod(ll &x, ll M = MOD)
{
    return (x % M + M) % M;
}

ll powm(ll &x, ll y = MOD - 2, ll M = MOD)
{
    if(!y) return 1;
    ll res = powm(x, y/2);
    res *= res;
    if(y % 2) res *= x;
    return mod(res, M);
}


int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n;
    cin >> n;

    ll sum = 0;

    vector<ll> v(10, -1);
    vector<ll> res(n, -1);

    v[0] = 0;

    FOR(i, n)
    {
        ll x;
        cin >> x;
        sum += x;
        if(x == 0) res[i] = 1;
        if(v[sum%10] != -1 && res[v[sum%10]] == -1) res[v[sum%10]] = i - v[sum%10] + 1;
        v[sum%10] = i+1;
    }

    cout << res;




    return 0;
}