//
//  na 2726.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/27.
//

#include <stdio.h>
#include <iostream>
#include <random>
using namespace std;
const int maxn = 1e5 + 5, lim = 316;
int n, m, a[maxn], dp[maxn][lim];
template<typename T> inline void rd(T &v){
    v = 0; char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    while(r - 48 < 10u){
        v = (v << 3) + (v << 1) + (r ^ 48);
        r = getchar();
    }
}
template<typename T> void pd(T v){
    if(v < 10)
        putchar(int(v) ^ 48);
    else{
        pd(v / 10);
        putchar(int(v % 10) ^ 48);
    }
}
inline void init(){
    for(int i = 0; i < lim; ++i)
        dp[n][i] = 1;
    for(int i = n - 1; i; --i){
        for(int j = i + a[i], k = 0; k < lim; ++k, ++j)
            dp[i][k] = (j > n? 1: dp[j][k] + 1);
    }
}
inline int sim(int p, int k){
    for(int i = 1; ; ++i){
        p += a[p] + k;
        if(p > n)
            return i;
    }
}
#ifdef MAC_OS_VERSION_11_0
//#define RNGCHECK
#endif
int main(){
    cin.tie(0)->sync_with_stdio(false);
    rd(n);
#ifdef RNGCHECK
    random_device rd_gen;
    mt19937 rnd(rd_gen());
    uniform_int_distribution<> dis(1, 1000);
    for(int i = 1; i <= n; ++i)
        a[i] = dis(rnd);
    init();
    for(int i = 1; i <= n; ++i)
        for(int j = 0; j < lim; ++j)
            if(sim(i, j) != dp[i][j])
                cerr << "ERR" << endl;
    return 0;
#else
    for(int i = 1; i <= n; ++i)
        rd(a[i]);
#endif
    init();
    rd(m);
    int p, k;
    while(m--){
        rd(p); rd(k);
        pd(k >= lim? sim(p, k): dp[p][k]);
        putchar('\n');
    }
    return 0;
}