#include <cmath>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 100005

int n,q,ai[maxn],bi[maxn][],size;

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

int dfs(int now,int k)

{

    if(now>n) return ;

    if(bi[now][k]) return bi[now][k];

    else return bi[now][k]=dfs(now+ai[now]+k,k)+;

}

int main()

{

    in(n),size=sqrt(n);

    for(int i=;i<=n;i++) in(ai[i]);

    in(q);int p,k;

    while(q--)

    {

        in(p),in(k);

        if(k>size)

        {

            int res=;

            while(p<=n)

            {

                res++;

                p+=ai[p]+k;

            }

            printf("%d\n",res);

        }

        else printf("%d\n",dfs(p,k));

    }

    return ;

}