#include <bits/stdc++.h>

using namespace std;
int n;
vector<int> j;
vector<int> whereTo;
int run(int spot, int dice, int step)
{
    step++;
    spot=spot+dice;
    if(spot > n-1)
    {
        return(step);
    }
    else if(whereTo[spot]>n-1)
    {
        return(step);
    }
    else
    {
        return(run(whereTo[spot],dice,step));
    }

}

int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(0);

    cin >> n;
    j = vector<int>(n,0);

    for(int i = 0; i<n ;i++)
    {
        cin >> j[i];

    }
    whereTo = vector<int>(n);

    for(int i = n-1; i >= 0;i--)
    {
        if(j[i] == 0)
        {
            whereTo[i] = i;
        }
        else if(i+j[i] > n-1)
        {
            whereTo[i] = i+j[i];
        }
        else
        {
            whereTo[i] = whereTo[i+j[i]];
        }
    }
    for(int i = 1; i<7; i++)
    {
        cout << run(0,i,0) << " ";
    }
}