#include<bits/stdc++.h>
#define N 530005
using namespace std;
int n,Q,dis[N],c[N];
void build(int q){
	if(q>=(1<<n)){
		dis[q]=c[q];
		return;
	}
	build(q*2);
	build(q*2+1);
	dis[q]=min(c[q],dis[q*2]+dis[q*2+1]);
}
void mdf(int x){
	if(x>(1<<n)){
		dis[x]=c[x];
		x/=2;
	}
	for(;x;x/=2) dis[x]=min(c[x],dis[x*2]+dis[x*2+1]);
}
int flx[21],frx[21],fly[21],fry[21];
int qry(int x,int y){
	int ans=1e9;
	int u=(1<<n)+x,v=(1<<n)+y-1;	
	if(x+1==y) ans=c[u];
	flx[n]=fry[n]=0;
	frx[n]=c[u],fly[n]=c[v];
	for(int i=n-1;i>=0;i--){
		if(u&1){
			flx[i]=min(flx[i+1]+dis[u^1],frx[i+1]+c[u/2]);
			frx[i]=min(frx[i+1],flx[i+1]+dis[u^1]+c[u/2]);
		}
		else{
			flx[i]=min(flx[i+1],frx[i+1]+dis[u^1]+c[u/2]);
			frx[i]=min(frx[i+1]+dis[u^1],flx[i+1]+c[u/2]);
		}
		if(v&1){
			fly[i]=min(fly[i+1]+dis[v^1],fry[i+1]+c[v/2]);
			fry[i]=min(fry[i+1],fly[i+1]+dis[v^1]+c[v/2]);
		}
		else{
			fly[i]=min(fly[i+1],fry[i+1]+dis[v^1]+c[v/2]);
			fry[i]=min(fry[i+1]+dis[v^1],fly[i+1]+c[v/2]);
		}
		if(u!=v&&u/2==v/2) ans=min(ans,frx[i+1]+fly[i+1]);
		u/=2,v/=2;
		if(u==v) ans=min(ans,min(flx[i]+fly[i],frx[i]+fry[i]));
	}
	return ans;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<(1<<(n+1));i++) scanf("%d",&c[i]);
	build(1);
	scanf("%d",&Q);
	for(int i=1;i<=Q;i++){
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		if(op==1) c[x]=y,mdf(x);
		else printf("%d\n",qry(x,y));
	}
}