#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-16;
const int MOD = 1000000007;
const long long INF = (long long)1e9 * 500;
template <typename T>
vector<T> readVector0(int n) {
  vector<T> res(n);
  for (int i = 0; i < n; i++) cin >> res[i];
  return res;
}
template <typename T>
vector<T> readVector1(int n) {
  vector<T> res(n + 1);
  for (int i = 1; i <= n; i++) cin >> res[i];
  return res;
}
inline long long mod(long long x, long long m = MOD) { return ((x + m) % m); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q;
  cin >> n;
  vector<int> a = readVector1<int>(n);
  cin >> q;
  int sq = sqrt(n) + 1;
  vector<vector<int> > dp(sq + 1, vector<int>(n + 1, 0));
  for (int k = 1; k <= sq; ++k) {
    for (int p = n; p > 0; p--) {
      if (p + a[p] + k > n)
        dp[k][p] = 1;
      else {
        dp[k][p] = dp[k][p + a[p] + k] + 1;
      }
    }
  }
  vector<int> res;
  for (int i = 0; i < q; ++i) {
    int k, p;
    cin >> p >> k;
    if (k <= sq) {
      res.push_back(dp[k][p]);
    } else {
      int r = 0;
      while (p <= n) {
        r++;
        p = p + a[p] + k;
      }
      res.push_back(r);
    }
  }
  for (int i = 0; i < res.size(); ++i) cout << res[i] << endl;
  return 0;
}
