#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define N n+1

#define rep for(int y=0;x;y=x,x=fa[x])

int a[],son[][],siz[],r[],fa[],x[];

inline void up(int x){siz[x]=siz[son[x][]]+siz[son[x][]]+;}

inline void rev(int x){swap(son[x][],son[x][]);r[x]^=;}

inline void pd(int x){

    if(r[x]){

      if(son[x][])rev(son[x][]);

      if(son[x][])rev(son[x][]);

      r[x]=;

    }

}

inline bool notroot(int x){return son[fa[x]][]==x||son[fa[x]][]==x;}

inline void push_all(int x){if(notroot(x))push_all(fa[x]);pd(x);}

inline int gs(int x){return son[fa[x]][]==x;}

inline void rot(int x){

    int y=fa[x],z=fa[y],b=gs(x),c=gs(y),d=son[x][!b];

    if(notroot(y))son[z][c]=x;fa[x]=z;if(d)fa[d]=y;

    son[y][b]=d;fa[y]=x;son[x][!b]=y;up(y),up(x);

}

inline void splay(int x){

    push_all(x);

    while(notroot(x)){

      int y=fa[x],z=fa[y];

      if(notroot(y)){

          if(gs(x)==gs(y))rot(y);

            else rot(x);

      }

      rot(x);

    }

}

inline void access(int x){rep splay(x),son[x][]=y,up(x);}

inline void makeroot(int x){access(x);splay(x);rev(x);}

inline void spt(int x,int y){makeroot(x);access(y);splay(y);}

inline void link(int x,int y){makeroot(x);fa[x]=y;}

inline void cut(int x,int y){

    makeroot(x);access(y);splay(y);

    fa[x]=son[y][]=;

    up(y);

}

int main(){

    int n,m,i,j,k,t;

    scanf("%d",&n);

    for(i=;i<=n;i++)siz[i]=;

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

      scanf("%d",&x[i]);

      if(i+x[i]<=n)link(i,i+x[i]);

        else link(i,N);

    }

    scanf("%d",&m);

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

      scanf("%d%d",&k,&t);t++;

      if(k==)spt(t,N),printf("%d\n",siz[son[N][]]);

        else cut(t,min(N,t+x[t])),scanf("%d",&x[t]),link(t,min(N,t+x[t]));

    }

    return ;

}