#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
vector<pair<int, int> > qu[N];
int ans[N];
int visited[N];
int pd[N];
int n;
int solve(int pos, int k) {
  if (pos > n) return 0;
  if (visited[pos] == k) return pd[pos];
  visited[pos] = k;
  return pd[pos] = 1 + solve(pos + a[pos] + k, k);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int p, k;
    scanf("%d %d", &p, &k);
    qu[k].push_back(pair<int, int>(p, i));
  }
  for (int k = 1; k <= n; k++) {
    for (int j = 0; j < qu[k].size(); j++) {
      int p = qu[k][j].first, idx = qu[k][j].second;
      ans[idx] = solve(p, k);
    }
  }
  for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
  return 0;
}
