#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

int solve(vector<int>a,int n){
	// cout<<"solve a = ";for(int i=1;i<=n;i++)cout<<a[i]<<" \n"[i==n];

	vector<pair<int,int> >vals;
	for(int i=1;i<=n;i++){
		int j=i;
		while(j+1<=n&&a[j+1]==a[i])j++;
		vals.emplace_back(mk(a[i],j-i+1)),i=j;
	}
	auto Rec=[&](vector<pair<int,int> >&A){
		vector<pair<int,int> >B;
		for(int i=0;i<A.size();i++){
			int j=i;int cnt=A[i].se;
			while(j+1<A.size()&&A[j+1].fi==A[i].fi)cnt+=A[j+1].se,j++;
			B.emplace_back(mk(A[i].fi,cnt)),i=j;
		}
		A=B;
	};
	while(1){
		int mx=0,mn=1e9;
		// cout<<"vals = ";for(auto [v,c]:vals)cout<<"("<<v<<","<<c<<") ";puts("");
		for(auto [v,c]:vals)if(v!=-1)cmax(mx,v),cmin(mn,v);
		// cout<<"mx = "<<mx<<" mn = "<<mn<<endl;
		if(mx==mn)break;
		vector<pair<int,int> >to;
		for(auto [v,c]:vals){
			if(v!=mn){
				to.emplace_back(mk(v,c));
				continue;
			}
			if(c%2==0)to.emplace_back(mk(v+1,c/2));
			else{
				if(c-1>0)to.emplace_back(mk(v+1,(c-1)/2));
				to.emplace_back(mk(-1,1));
				if(c-1>0)to.emplace_back(mk(v+1,(c-1)/2));
			}
		}
		// cout<<"to = ";for(auto [v,c]:to)cout<<"("<<v<<","<<c<<") ";puts("");
		Rec(to);
		// cout<<" -> to = ";for(auto [v,c]:to)cout<<"("<<v<<","<<c<<") ";puts("");
		vals=to;
	}
	int cc=0,vv=0;
	for(auto [v,c]:vals)if(v!=-1)cmax(cc,c),vv=v;
	while(cc>=2)cc>>=1,vv++;
	
	return vv;
}

const int N=1e5+5;
int A[N],n;
void prepare_game(vector<int>vec){
	n=vec.size();
	for(int i=0;i<n;i++)A[i]=vec[i];
}

int play_game(int l,int r){
	vector<int>a;a.emplace_back(0);
	for(int i=l;i<=r;i++)a.emplace_back(A[i]);
	return solve(a,a.size()-1);
}

void update_game(int p,int v){A[p]=v;}

#ifndef ONLINE_JUDGE
signed main(void){

	freopen("hydro2.in","r",stdin);
	n=read();
	for(int i=0;i<n;i++)A[i]=read();
	int q=read();
	// puts("ok");
	for(int i=1;i<=q;i++){
		int op=read(),x=read(),y=read();
		if(op==2)update_game(x,y);
		else cout<<play_game(x,y)<<endl;
	}

	return 0;
}
#endif