#include<bits/stdc++.h>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")#define rep(i,a,b) for (int i=a;i<=b;i++)#define per(i,b,a) for (int i=b;i>=a;i--)#define mes(a,b)  memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define MP make_pair#define PB push_back#define fi  first#define se  secondtypedef long long ll;const int N = 100005;int dp[N][351], n, q, a[N], p, k;int solve(int p, int k){    if(p>n) return 0;    if(dp[p][k]!=0) return dp[p][k];    return dp[p][k]=solve(p+a[p]+k, k)+1;}int main(){    scanf("%d", &n);    rep(i,1,n) scanf("%d", &a[i]);    scanf("%d", &q);    rep(i,1,q)    {        scanf("%d %d", &p, &k);        if(k>350)        {            int cnt=0;            while(p<=n) p=p+a[p]+k, ++cnt;            printf("%d\n", cnt);        }        else printf("%d\n", solve(p, k));    }    return 0;}