#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 100010, M = 320;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, q;
int a[N], f[M][N];

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    for (int k = 1; k <= 300; k ++)
        for (int i = n; i >= 1; i --)
        {
            if (i + a[i] + k > n) f[k][i] = 1;
            else f[k][i] = f[k][i + a[i] + k] + 1;
        }

    read(q);
    while (q --)
    {
        int pos, k; read(pos, k);
        if (k <= 300) cout << f[k][pos] << '\n';
        else
        {
            int ans = 0;
            for (int cur = pos; cur <= n; cur = cur + a[cur] + k)
                ans ++;
            cout << ans << '\n';
        }
    }

    return 0;
}