#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
int n,q;
vector<int> a;
queue <int> ans;
int solve(int s,int f)
{
    int br=1;
    while(a[s]<f-s){
        int m=-1,mi=-1;
        for(int i=s;i<=a[s]+s;i++)
        {
            if(a[i]>=m){
                m=a[s];
                mi=i;
            }
        }
        br++;
        s=mi;
    }
    return br;
}
void read()
{
    fstream fin;
    fin.open("jumps.in",fstream::in|fstream::binary);
    fin>>n;
    for(int i=0;i<n;i++)
    {
        int l;
        fin>>l;
        a.push_back(l);
    }
    fin>>q;
    for(int i=0;i<q;i++)
    {
        int s,f;
        fin>>s>>f;
        ans.push(solve(s-1,f-1));
    }
}

int main ()
{
    read();
    fstream fout;
    fout.open("jumps.out",fstream::out|fstream::binary);
    while(!ans.empty())
    {
        int l=ans.front();
        fout<<l<<endl;
        //cout<<l<<endl;
        ans.pop();

    }
    return 0;
}