#include<iostream>
#include<cstdio>
#define ll long long
#define N 200009

ll f[N],c[N][2],s[N];//父亲，儿子，权值

#define l(x) c[x][0]
#define r(x) c[x][1]
#define f(x) f[x]

inline bool nroot(int x){return l(f(x)) == x || r(f(x)) == x;}//一个点是否不是splay的根

inline void up(int x){s[x] = s[l(x)] + s[r(x)] + 1;}

inline void rotate(int x){
//	std::cout<<x<<std::endl;	
	int y = f(x),z = f(y),k = (r(y) == x),w = c[x][!k];
	if(nroot(y))
	c[z][r(z) == y] = x;c[x][!k] = y;c[y][k] = w;
	if(w)f(w) = y;f(y) = x;f(x) = z;
	up(y);up(x);
} 

inline void splay(int x){
//	std::cout<<x<<std::endl;
	int y,z;
	while(nroot(x)){
		y = f(x);z = f(y);
		if(nroot(y))
		rotate((l(y) == x) ^ (l(z) == y)?x:y);
		rotate(x);
	}
	up(x);
}

inline void access(int x){
	for(int y = 0;x;x = f[y = x])
	splay(x),c[x][1] = y,up(x);
}

ll n,m;

int main(){
	scanf("%lld",&n);
	for(int i = 1;i <= n;++i){
		s[i] = 1;
		ll k;
		scanf("%lld",&k);
		if(i + k <= n)
		f[i] = i + k;
	}
	scanf("%lld",&m);
	while(m -- ){
		ll opt,x,y;
		scanf("%lld",&opt);
		if(opt & 1){
			scanf("%lld",&x);
			++x;
			access(x),splay(x);
			std::cout<<s[x]<<std::endl;
		}else{
			scanf("%lld%lld",&x,&y);
			++x; 
			access(x),splay(x);
			l(x) = f(l(x)) = 0;
			if(x + y <= n)
			f(x) = x + y;
			up(x);
		}
	}
}