#include <bits/stdc++.h>

 using namespace std;

 const int maxn=+;

 int n,m;

 struct node{

     node* ch[],* pa;

     int s;

     node(node* t){ s=; ch[]=ch[]=pa=t; }

     bool d(){ return pa->ch[]==this; }

     bool c(){ return pa->ch[]==this||pa->ch[]==this; }

     void setc(node* x,bool d){ ch[d]=x; x->pa=this; }

     void push_up(){ s=ch[]->s+ch[]->s+; }

 }* null,* t[maxn];

 void rot(node* x){

     node* pa=x->pa; bool d=x->d();

     if(pa->c()) pa->pa->setc(x,pa->d());

     else x->pa=pa->pa;

     pa->setc(x->ch[!d],d);

     x->setc(pa,!d);

     pa->push_up();

 }

 void splay(node* x){

     while(x->c())

         if(!x->pa->c()) rot(x);

         else x->d()==x->pa->d()?(rot(x->pa),rot(x)):(rot(x),rot(x));

     x->push_up();

 }

 void access(node* x){

     node* t=x;

     for(node* y=null;x!=null;y=x, x=x->pa){

         splay(x);

         x->ch[]=y;

     }

     splay(t);

 }

 void link(node* x,node* y){

     access(x);

     x->ch[]->pa=null; x->ch[]=null; x->pa=y; x->push_up();

 }

 int main(){

     null=new node(NULL); null->s=;

     scanf("%d",&n);

     for(int i=;i<n;i++) t[i]=new node(null);

     for(int i=;i<n;i++){

         int k; scanf("%d",&k);

         if(i+k<n) t[i]->pa=t[i+k];

     }

     scanf("%d",&m);

     for(int i=;i<=m;i++){

         int q,x,y;

         scanf("%d%d",&q,&x);

         if(q==){

             access(t[x]);

             printf("%d\n",t[x]->s);

         }

         else{

             scanf("%d",&y);

             if(x+y<n) link(t[x],t[x+y]);

             else link(t[x],null);

         }

     }

     return ;

 }