#include <bits/stdc++.h>
using namespace std;

const int MAX = 200000+2;
int N, K[MAX], M;

int jump(int i, int ans)
{
	if(i+K[i] >= N) return ans;
	jump(i+K[i], ans+1);
}

int main(void)
{
	ifstream fin("bzoj_2002.in");
	ofstream fout("bzoj_2002.out");
	fin >> N;
	for(int i=0; i<N; i++)
		fin >> K[i];
	fin >> M;
	for(int i=1, I_, J_, K_; i<=M; i++)
	{
		fin >> I_ >> J_;
		if(I_ == 1) fout << jump(J_, 1) << endl;
		else if(I_ == 2) { fin >> K_; K[J_] = K_; }
	}
	fin.close();
	fout.close();
	return 0;
}