#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int a[N];
int ans;
int an[N];
int n;
int dfs(int x){
    if(x+a[x]>n){
        an[x]=1;
        return 1;
    }
    else if(an[x]){
        return an[x];
    }
    else{
        an[x]=dfs(x+a[x])+1;
        return an[x];
    }
}
signed main(){
    
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    if(n<=105){
        int m;
        cin>>m;
        while(m--){
            int p,k,ans=0;
            scanf("%lld %lld",&p,&k);
            while(p<=n){
                ans++;
                p+=a[p]+k;
            }
            printf("%lld\n",ans);
        }
        return 0;
    }
    for(int i=1;i<=n;i++){
        if(an[i])continue;
        an[i]=dfs(i);
    }
    int m;
    cin>>m;
    while(m--){
        int p,k;
        scanf("%lld %lld",&p,&k);
        printf("%lld\n",an[p]);
    }
    return 0;
}