/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
bool allone(int a[],int n)
{
    for(int i=1;i<=n;i++)
    {
        if(a[i]!=1) return false;
    }return true;
}
int main()
{
    int n; cin >> n;
    int a[n+1],cnt[n+1],last[n+1];
    for(int i=1;i<=n;i++) cin >> a[i];
    if(allone(a,n))
    {
        for(int i=1;i<=n;i++)
        {
            cout<<n<<' '<<n-i+1<<'\n';
        }
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        int j = i;
        int cn = 1;
        while(j+a[j] <= n)
        {
            ++cn;
            j += a[j];
        }
        last[i] = j;
        cnt[i] = cn;
    }

    for(int i=1;i<=n;i++) cout<<last[i]<<' '<<cnt[i]<<'\n';
}