#include <bits/stdc++.h>
using namespace std;
struct node {
  int id, q, k;
} qu[100009];
int a[100009], dp[100009], n, m, ans[100009];
bool cmp(node a, node b) { return a.k < b.k; }
int qiu(int wei, int k) {
  if (wei > n) return 0;
  if (dp[wei] != 0)
    return dp[wei];
  else {
    dp[wei] = qiu(wei + a[wei] + k, k) + 1;
    return dp[wei];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) scanf("%d%d", &qu[i].q, &qu[i].k), qu[i].id = i;
  sort(qu + 1, qu + m + 1, cmp);
  for (int i = 1; i <= m; i++) {
    if (i == 1 || qu[i].k != qu[i - 1].k) {
      memset(dp, 0, sizeof(dp));
      dp[n] = 1;
    }
    ans[qu[i].id] = qiu(qu[i].q, qu[i].k);
  }
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
}
