#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

char wb[BUFFER_SIZE], *wp = wb;
inline void write_flush() {
    fwrite(wb, 1, wp - wb, stdout);
    wp = wb;
}
inline void write_char(char c) {
    *wp ++ = c;
    if (wp == wb + BUFFER_SIZE) {
        write_flush();
    }
}
inline void write_int(int x) {
    if (x == 0) {
        write_char('0');
    } else if (x < 0) {
        write_char('-');
        x = -x;
    }
    static char b[32], i;
    for (i = 1; x; i ++) {
        b[i] = x % 10 + '0';
        x /= 10;
    }
    for (i --; i; i --) {
        write_char(b[i]);
    }
}

const int MAX_N = 100000 + 5;
const int K = 300;

int N, M;
int a[MAX_N], ans[MAX_N];
vector<pair<int,int>> qi[K + 5];
int f[MAX_N];

int main() {
    N = read_int();
    for (int i = 1; i <= N; i ++) {
        a[i] = read_int();
    }
    M = read_int();
    for (int i = 1; i <= M; i ++) {
        int p = read_int(), k = read_int();
        if (k <= K) {
            qi[k].push_back(make_pair(i, p));
        } else {
            for (; p <= N; p += a[p] + k) ans[i] ++;
        }
    }
    for (int k = 0; k <= K; k ++) {
        if (qi[k].empty()) continue;
        for (int i = N; i >= 1; i --) {
            int j = i + a[i] + k;
            f[i] = j > N ? 1 : f[j] + 1;
        }
        for (auto t: qi[k]) {
            ans[t.first] = f[t.second];
        }
    }
    for (int i = 1; i <= M; i ++) {
        write_int(ans[i]), write_char('\n');
    }
    write_flush();
    return 0;
}