#pragma GCC optimize("O3")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define BOOST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(a, b, c) for(int a = b; a < c; ++a)
#define PB push_back
#define MP make_pair
#define INF (int)1e9+7
#define LLINF 2e18+7
#define ALL(a) a.begin(), a.end()
#define SIZE(a) (int)a.size()

typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;

using namespace std;

//#define DEBUG

const int MAX = 1e5+8;
int coaches[MAX];
vector <int> sfsums[MAX];

int main()
{
    #ifndef DEBUG
    BOOST;
    #endif

    int n;
    cin >> n;

    FOR(i, 0, n)
    {
        cin >> coaches[i];
    }

    vector <int> res;

    int suffsum = 0;
    sfsums[0].push_back(n);

    for (int i = n - 1; i >= 0; --i)
    {
        suffsum = (suffsum + coaches[i]) % 10;

        int potential = -1;

        if (sfsums[suffsum].size())
        {
            if (potential == -1 or potential > sfsums[suffsum].back())
                potential = sfsums[suffsum].back() - i;
        }
        
        if(sfsums[(10 - suffsum) % 10].size())
        {
            if(potential == -1 or potential > sfsums[(10 - suffsum) % 10].back())
                potential = sfsums[(10 - suffsum) % 10].back() - i;
        }
        
        res.push_back(potential);
        sfsums[suffsum].push_back(i);
    }

    reverse(res.begin(), res.end());

    for(auto& x : res)
    {
        cout << x << " ";
    }

    return 0;
}