#include<bits/stdc++.h>
using namespace std;
int n,a[1<<20],p2[1001000];
const int mod=1e9+7;
int si[101000],ans[101000];bool f3[100100];
struct ed{int op,x,z;};
vector<ed>g[1010000];
int be[1010000],B,dfn[1010000],out[1010000];
void dfs(int x){
	be[++B]=x,dfn[x]=B;
	int ls=(x<<1),rs=(x<<1|1);
	if(ls<=n)dfs(ls),dfs(rs);
	out[x]=B;
}
int f[1010000],va[1010000],tr[401000];
priority_queue<int>q1,q2;
void ad(int x,int z){for(;x<=n;x+=(x&-x))tr[x]+=z;}
void cl(int x){for(;x<=n;x+=(x&-x))tr[x]=0;}
int ask(int x){int s=0;for(;x;x-=(x&-x))s+=tr[x];return s;}
int Top(){while(!q1.empty()&&!q2.empty()&&q1.top()==q2.top())q1.pop(),q2.pop();return q1.empty()?0:q1.top();}
void dfs2(int x){
	int ls=(x<<1),rs=(x<<1|1);
	if(ls<=n)dfs2(ls),dfs2(rs);
	else{f[dfn[x]]=a[x];return;}
	int l=dfn[x],r=out[x];
	for(int i=l;i<=r;i++)va[i]=a[be[i]];
	sort(va+l,va+r+1);
	f[l]=va[l];
	for(int i=l+1;i<=r;i++)f[i]=*upper_bound(va+l,va+r+1,f[i]);
	while(!q1.empty())q1.pop();while(!q2.empty())q2.pop();
	int S=0;
	for(ed t:g[x]){
		if(t.op<=2){
			if(t.z==1){
				if(t.op==1)q1.push(f[dfn[t.x]]);
				else q2.push(f[dfn[t.x]]);
			}
			else{
				int Z=((t.op==1)?1:-1);
				S+=Z,ad(f[dfn[t.x]],Z);
			}
		}
		else{
			int p=Top();
			if(p>t.z)ans[t.x]=0;
			else{
				int s1=ask(t.z-1),s2=ask(t.z);s2-=s1;
				if(p==t.z)ans[t.x]=p2[s1+s2];
				else ans[t.x]=1ll*p2[s1]*(p2[s2]-1)%mod;
				ans[t.x]=1ll*ans[t.x]*p2[si[t.x]-S]%mod;
			}
		}
	}
	for(int i=l;i<=r;i++)cl(f[i]);
}
#define pb push_back
int main(){
	scanf("%d",&n);n=(1<<n)-1;
	p2[0]=1;
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),p2[i]=2*p2[i-1]%mod;
	dfs(1);
	int q;scanf("%d",&q);
	for(int i=1,op,x,z;i<=q;i++){
		scanf("%d%d%d",&op,&x,&z);
		si[i]=si[i-1];
		if(op<=2&&z==2){if(op==1)si[i]++;else si[i]--;}
		if(op<=2){int u=x;while(u)g[u].pb((ed){op,x,z}),u>>=1;}
		else g[x].pb((ed){op,i,z}),f3[i]=1;
	}
	dfs2(1);
	for(int i=1;i<=q;i++)if(f3[i])printf("%d\n",ans[i]);
	return 0;
}