#include <iostream>
#include <stdio.h>
using namespace std;

int n;
int q;
int a[100111];

pair<int,int> IT[500111];
int LEAFOFFSET;

pair<int,int> MAX(pair<int,int> a,pair<int,int> b)
{
    if (a.first > b.first)
        return a;
    else
        return b;
}

pair<int,int> getQuery(int L,int R)
{
    if (R > n)
        R = n;

    pair<int,int> ans = MAX(IT[L+LEAFOFFSET], IT[R+LEAFOFFSET]);

    L += LEAFOFFSET;
    R += LEAFOFFSET;

    while(R - L > 1)
    {
        if (L % 2 == 0)
            ans = MAX(ans, IT[L+1]);
        if (R % 2 == 1)
            ans = MAX(ans, IT[R-1]);

        L /= 2;
        R /= 2;
    }

    return ans;
}

int MIN(int a,int b)
{
    if (a < b)
        return a;
    else
        return b;
}

pair<int,int> jumps[100111][22];

int main()
{
    freopen("jumps.in","r",stdin);
    freopen("jumps.out","w",stdout);

    int i,j;

    scanf("%d",&n);

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

    LEAFOFFSET = 1;
    while(LEAFOFFSET < n)
        LEAFOFFSET *= 2;
    LEAFOFFSET--;

    for (i=1;i<=n;i++)
    {
        IT[i+LEAFOFFSET] = make_pair(i + a[i], i);
    }

    for (i=LEAFOFFSET;i>=1;i--)
    {
        IT[i] = MAX(IT[2*i], IT[2*i+1]);
    }

    for (i=1;i<=n;i++)
    {
        jumps[i][0] = make_pair( getQuery(i, i + a[i]).second, i + a[i] );
        //cout<<"One jump from "<<i<<" is "<<jumps[i][0].first<<";"<<jumps[i][0].second<<endl;
    }

    for (i=1;i<=20;i++)
    {
        for (j=1;j<=n;j++)
        {
            jumps[j][i] = jumps[ jumps[j][i-1].first ][i-1];
            //cout<<"From "<<j<<" with "<<(1<<i)<<" jumps we get to "<<jumps[j][i].second<<" but max reach from "<<jumps[j][i].first<<endl;
        }
    }

    scanf("%d",&q);

    for (i=1;i<=q;i++)
    {
        int x,y;
        int ans = n;
        int sofar = 0;
        scanf("%d %d",&x,&y);

        for (j=20;j>=0;j--)
        {
            if (jumps[x][j].second >= y)
            {
                //cout<<"Can do right away "<<(1<<j)<<endl;
                //cout<<"y is "<<y<<" and we have x="<<x<<" with reachability "<<jumps[x][j].second<<endl;
                ans = MIN(ans, (1<<j) + sofar);
            }
            else
            {
                //cout<<"Move "<<(1<<j)<<endl;
                x = jumps[x][j].first;
                sofar += (1<<j);
            }
        }

        printf("%d\n",ans);
    }

    return 0;
}