#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

const int infty = 1000000000;

vector<int> count(const vector<int>&V){
    set<int>prefix_occ[10];
    vector<int>prefix(V.size());
    int acc=0;
    for(int i=0;i<(int)V.size();i++){
        acc = (acc + V[i]) % 10;
        prefix[i] = acc;
        prefix_occ[acc].insert(i);
    }

    vector<int>result(V.size());
    for(int i=0;i<(int)V.size();i++){
        int pre = i==0 ? 0 : prefix[i-1];
        if(prefix_occ[pre].empty())
            result[i] = infty;
        else
            result[i] = *prefix_occ[pre].begin() - i+1;
        prefix_occ[prefix[i]].erase(i);
    }
    return result;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int>V(n);
    for(int &x : V)
        cin >> x;
    
    auto forward = count(V);

    for(int i=0;i<n;i++){
        int val = forward[i];
        if(val == infty)
            cout << "-1 ";
        else
            cout << val << " ";
    }
    cout << "\n";

    return 0;
}