#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;

int A[N];
int curr[N];
int suf[N];
int ans[N];

int main()
{
	int n;
	scanf("%d", &n);

	for(int i=1;i<=n;i++)
	{
		scanf("%d", &A[i]);
	}

	suf[n+1] = 0;
	for(int i=n;i>=0;i--)
	{
		suf[i] = (suf[i+1] + A[i]) % 10;
	}

	for(int k=0;k<10;k++)
		curr[k] = -1;

	curr[0] = n+1;

	for(int i=n;i>=0;i--)
	{
		if(curr[suf[i]] == -1)
		{
			ans[i] = -1;
		}

		else
		{
			ans[i] = curr[suf[i]] - i;
		}

		curr[suf[i]] = i;
	}

	for(int i=1;i<=n;i++)
	{
		printf("%d ", ans[i]);
	}
	puts("");
}