#include<bits/stdc++.h> using namespace std; inline int read() { int x=0; bool f=1; char c=getchar(); while(c<'0'||c>'9'){if(c=='-')f=0;c=getchar();} while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();} return f?x:-x; } int n,m,block,a[200005],bl[200005],f[200005],g[200005],I,J,K; void ad(int pos,int x) { a[pos]=x; for(int i=min(n,bl[pos]*block);i>(bl[pos]-1)*block;i--) if(i+a[i]>n)f[i]=1,g[i]=n+1; else if(i+a[i]<=bl[i]*block)f[i]=f[i+a[i]]+1,g[i]=g[i+a[i]]; else f[i]=1,g[i]=i+a[i]; } int main(){ n=read(); block=sqrt(n); for(int i=1;i<=n;i++) a[i]=read(),bl[i]=(i-1)/block+1; for(int i=n;i;i--){ if(i+a[i]>n)f[i]=1,g[i]=n+1; else if(i+a[i]<=bl[i]*block)f[i]=f[i+a[i]]+1,g[i]=g[i+a[i]]; else f[i]=1,g[i]=i+a[i]; } m=read(); while(m--){ I=read(),J=read()+1; if(I==1){ int ans=0; for(;J<=n;J=g[J]) ans+=f[J]; printf("%d\n",ans); } else{ K=read(); ad(J,K); } } return 0; }