#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define pb push_back #define debug(x) cout << #x << " " << x << endl #define all(x) x.begin(),x.end() #define ll long long #define vi vector #define vvi vector #define vvvi vector #define vll vector #define vvll vector #define ld long double #define ull unsigned long long #define vull vector #define fi first #define se second #define PII pair #define vPII vector #define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());} int a[100005]; vi vals[10]; int suma[100005]; int ans[100005]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // cout << setprecision(12) << fixed; // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); int tt = 1; // cin >> tt; while(tt--){ int n; cin >> n; a[0] = 0; rep(i,n) cin >> a[i+1]; vals[0].pb(0); for(int i = 1; i <= n; i++){ ans[i] = -1; suma[i] = (suma[i-1] + a[i])%10; vals[suma[i]].pb(i); } rep(i,10){ int x = vals[i].size(); rep(j,x-1){ ans[vals[i][j]+1] = vals[i][j+1] - vals[i][j]; } } rep(i,n-1){ cout << ans[i+1] << " "; } cout << ans[n]; } }