#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 + 42, C = 300;
int n, arr[nmax];
int answer[nmax][C];
int main() {
  scanf("%i", &n);
  for (int i = 1; i <= n; i++) scanf("%i", &arr[i]);
  int p, k, now;
  for (k = 1; k < C; k++)
    for (p = n; p >= 1; p--) {
      now = p + arr[p] + k;
      if (now > n)
        answer[p][k] = 1;
      else
        answer[p][k] = 1 + answer[now][k];
    }
  int q;
  scanf("%i", &q);
  for (int i = 1; i <= q; i++) {
    scanf("%i%i", &p, &k);
    if (k < C)
      printf("%i\n", answer[p][k]);
    else {
      now = 0;
      while (p <= n) {
        p = p + arr[p] + k;
        now++;
      }
      printf("%i\n", now);
    }
  }
  return 0;
}
