// Problem: D. 8.3t4
// Contest: undefined - NOIP2024训练赛 15
// URL: http://noi.ac/contest/1167/problem/2726
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 1e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, B = 350;

int n, m, q, ans, cnt;
int s[N], sum[N][450];

// vector<int> e[N];

void dfs(int now, int id)
{
	if(now > n) return;
	if(sum[now][id]) {cnt = sum[now][id] + 1; return;}
	dfs(now + s[now] + id, id);
	sum[now][id] = cnt ++;
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i ++) cin >> s[i];
	for(int i = 1; i <= B; i ++)
	{
		for(int st = 1; st <= n; st ++)
		{
			if(sum[st][i]) continue;
			cnt = 1; dfs(st, i);
		}
	}
	// cout << "2 1 = " << ed[id[2][1]][1] << '\n';
	cin >> q;
	while(q --)
	{
		int p, k; cin >> p >> k;
		if(k < B) cout << sum[p][k] << '\n';
		else
		{
			int res = 0;
			while(p <= n) res ++, p = p + s[p] + k;
			cout << res << '\n';
		}
	}
	return 0;
}