#include<iostream>
#include<fstream>
using namespace std;
int i,j,A[1000],B[1000][1000],C[1000];
double N,Q;
/*void Vhod()
{
	cin>>N;
	for(int i=1;i<=N;i++)
	cin>>A[i];
	cin>>Q;
	j=1;
	for(int i=1;i<=Q;i++)
    {
        cin>>B[i][j];	
        cin>>B[i][j+1];	
    }
}
void sum()
{
	
    double x,y;
    int k=1,counter,max=0,counterPos;
	while(k<=Q)
	{
        counter=0;
	    x=B[k][1];
	    y=B[k][2];
	
	    while(x<y)
	    {
	    	
		    i=x;
		    max=0;
		    if(x+A[i]>=y)
		    {
		    	counter++;
		        break;	
			}
		    for(j=x+1;j<=(A[i]+x);j++)
		    {
			    if(max<=A[j])
			    {
			        max=A[j];
			        counterPos=j;
		        }   
		    }
		    x=counterPos;
		    counter++;
	    }
	    C[k]=counter;
        k++;
	    
    }
    
}*/
void In()
{
	ifstream InputFile;
	InputFile.open("jumps.in",ios::in);
	InputFile>>N;
	for(int i=1;i<=N;i++)
	    InputFile>>A[i];
	InputFile>>Q;
	j=1;
	for(int i=1;i<=Q;i++)
    {
        InputFile>>B[i][j];	
        InputFile>>B[i][j+1];	
    }
}
void Sum()
{
    double x,y;
    int k=1,counter,max=0,counterPos;
	while(k<=Q)
	{
        counter=0;
	    x=B[k][1];
	    y=B[k][2];
	
	    while(x<y)
	    {
	    	
		    i=x;
		    max=0;
		    if(x+A[i]>=y)
		    {
		    	counter++;
		        break;	
			}
		    for(j=x+1;j<=(A[i]+x);j++)
		    {
			    if(max<=A[j])
			    {
			        max=A[j];
			        counterPos=j;
		        }   
		    }
		    x=counterPos;
		    counter++;
	    }
	    C[k]=counter;
        k++;
	    
    }
}
void Out()
{
	int k=Q;
	ofstream OutFile;
    OutFile.open("jumps.out",ios::out);
	for(i=1;i<=k;i++)    
        OutFile<<C[i]<<endl;
}
int main()
{	

	In();
	Sum();
Out();
    return 0;
}