#include <stdio.h>
const int C=100069, D=10;

int dp[C][D], csc[C], a[C], res[C];
int main(){
	int n, i, j;
	scanf ("%d", &n);
	for (i=0; i<n; i++) scanf ("%d", &a[i]);
	for (i=0; i<D; i++) dp[n][i]=-1;
	dp[n][0]=n;

	for (i=n-1; i>=0; i--){
		csc[i]=(csc[i+1]+a[i])%D;
		for (j=0; j<D; j++) dp[i][j]=dp[i+1][j];
		if (dp[i][csc[i]]==-1){
			res[i]=-1;
		}
		else res[i]=dp[i][csc[i]]-i;
		printf ("%d %d %d\n", i, csc[i], dp[i][csc[i]]);
		dp[i][csc[i]]=i;
	}
	for (i=0; i<n-1; i++) printf ("%d ", res[i]);
	printf ("%d\n", res[n-1]);
return 0;}