#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
// #include <bits/stdc++.h>
#include <cstdio>
#include <cmath>

using namespace std;

#define ll long long
#define FOR(i, L, R) for (int i = L; i < R; i++)
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define int long long int


int t;
int coaches[100042];
int tmp;

int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    /* ---------------------------------------------------------------------- */
    cin >> t;


    for (int i = 1; i < t+1; i++){
        cin >> tmp;
        coaches[i] = coaches[i-1] + tmp;
        // cout << i << ": " << coaches[i] << endl;
    }
    // cout << endl;

    for (int i = 1; i < t+1; i++)
    {
        bool possible = false;

        for (int j = i; j < t+1; j++)
        {
            // cout << coaches[j]-coaches[i-1] << " ";
            if((coaches[j]-coaches[i-1])%10==0)
            {
                possible=true;
                cout << j-(i-1) << " ";
                break;

            }
        }
        // cout << endl;
        if(!possible){
            cout << -1 << " ";
        }

    }
    cout << endl;


    return 0;
}