#include <cstdio>
using namespace std;
int steps[510][100010];
int n, a[100010], m, p, k;
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 0; i * i <= n; i++) {
        for (int j = n; j >= 1; j--) {
            if (j + i + a[j] > n) {
                steps[i][j] = 1;
            } else {
                steps[i][j] = steps[i][j + i + a[j]] + 1;
            }
        }
    }
    scanf("%d", &m);
    while (m--) {
        scanf("%d%d", &p, &k);
        if (1ll * k * k <= n) {
            printf("%d\n", steps[k][p]);
        } else {
            int now = p;
            int cnt = 0;
            while (true) {
                if (now > n) {
                    break;
                }
                now += k + a[now];
                cnt++;
            }
            printf("%d\n", cnt);
        }
    }
    return 0;
}