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

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ll n;
  cin >> n;
  vector<ll> a(n);
  for (int i = 0; i < n; ++ i) {
    cin >> a[i];
  }

  vector<ll> pf(n);
  pf[0] = a[0];
  for (int i = 1; i < n; ++ i) pf[i] = pf[i - 1] + a[i];

  vector<set<int>> idx(10);
  for (int i = 0; i < n; ++ i) {
    idx[pf[i] % 10].insert(i);
  }

  for (int i = 0; i < n; ++ i) {
    // find closest greater index
    set<int> & curIdx = idx[(pf[i] - a[i] + 10) % 10];
    while (curIdx.size() && *curIdx.begin() < i) curIdx.erase(curIdx.begin());

    if (curIdx.size())
      cout << *curIdx.begin() - i + 1 << ' ';
    else
      cout << -1 << ' ';
  }
  cout << endl;

  return 0;
}