#include <bits/stdc++.h>
using namespace std;
int n;
int f[100010][100 + 10];
int a[100010];
inline int Get() {
  char c;
  while (c = getchar(), c < '0' || '9' < c)
    ;
  int s = c - '0';
  while (c = getchar(), '0' <= c && c <= '9') s = s * 10 + c - '0';
  return s;
}
void Out(int x) {
  if (x < 10)
    putchar(x + '0');
  else {
    Out(x / 10);
    putchar(x % 10 + '0');
  }
}
int dfs(int p, int k) {
  if (p > n) return 0;
  if (f[p][k]) return f[p][k];
  return f[p][k] = dfs(p + a[p] + k, k) + 1;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int p, k;
    scanf("%d%d", &p, &k);
    if (k <= 100)
      printf("%d\n", dfs(p, k));
    else {
      int ans = 0;
      while (p <= n) {
        int gg = a[p] + k;
        p += gg;
        ++ans;
      }
      printf("%d\n", ans);
    }
  }
}
