#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cmath>
#define N 18
#define M 1000000
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int h,q,leng,ans,lg[1<<N],depth[1<<N],dfn[1<<N],sz[1<<N],num[1<<N],pw2[1<<N],a[1<<N],F[1<<N],inv[3]={0,1,(mod+1)>>1},cnt;
bool used[1<<N],used2[1<<N];
vector<int>p[1<<N];
vector<int>A[1<<N];
vector<int>B[1<<N];
vector<int>dp[1<<N];
bool cmp(int x,int y)
{
	return x>y;
}
bool LENG(int x,int y)
{
	return dfn[x]<=dfn[y]&&dfn[y]<=dfn[x]+sz[x]-1;
}
void dfs(int x)
{
	dfn[x]=++leng;
	if ((x<<1)<=(1<<h)-1)
	{
		depth[x<<1]=depth[x<<1|1]=depth[x]+1,dfs(x<<1),dfs(x<<1|1),sz[x]=sz[x<<1]+sz[x<<1|1]+1;
		for (int i=0;i<sz[x<<1];++i) p[x].push_back(p[x<<1][i]);
		for (int i=0;i<sz[x<<1|1];++i) p[x].push_back(p[x<<1|1][i]);
		p[x].push_back(a[x]);
	}
	else sz[x]=1,p[x].push_back(a[x]);
	A[x].resize(sz[x]+1),B[x].resize(sz[x]+1),dp[x].resize(sz[x]+1),sort(p[x].begin(),p[x].end(),cmp);
	for (int i=0;i<=sz[x];++i) dp[x][i]=1;
	return;
}
int get_rk(int x,int d)
{
	int ps=0;
	for (int i=lg[sz[x]];i>=0;--i)
		if (ps+(1<<i)<sz[x]&&p[x][ps+(1<<i)]>=d)
			ps+=(1<<i);
	return ps;
}
int query(int x,int d)
{
	if (depth[x]>=(h>>1)) return dp[x][d];
	else
	{
		if (d==sz[x]) return 1ll*query(x<<1,sz[x<<1])*query(x<<1|1,sz[x<<1|1])%mod*F[x]%mod;
		else return 1ll*query(x<<1,A[x][d])*query(x<<1|1,B[x][d])%mod;
	}
}
int calc(int x,int d)
{
	d=get_rk(x,d);
	return 1ll*MD2(query(x,d)-(d!=sz[x]?query(x,d+1):0))*pw2[cnt]%mod;
}
void change(int x)
{
	while (depth[x]>=(h>>1))
	{
		if ((x<<1)<=(1<<h)-1)
		{
			for (int i=0;i<=sz[x]-1;++i) dp[x][i]=1ll*dp[x<<1][A[x][i]]*dp[x<<1|1][B[x][i]]%mod;
			dp[x][sz[x]]=1ll*dp[x<<1][sz[x<<1]]*dp[x<<1|1][sz[x<<1|1]]%mod*F[x]%mod;
		}
		else dp[x][0]=1,dp[x][1]=F[x];
		x>>=1;
	}
	return;
}
int main()
{
	int op,x,y,ps,ps2;
	for (int i=2;i<=(1<<N)-1;++i) lg[i]=lg[i>>1]+1;
	pw2[0]=1;
	for (int i=1;i<=(1<<N)-1;++i) pw2[i]=2ll*pw2[i-1]%mod;
	h=read();
	for (int i=1;i<=(1<<h)-1;++i) a[i]=read(),num[a[i]]=i;
	depth[1]=1,dfs(1);
	for (int i=1;(i<<1)<=(1<<h)-1;++i)
	{
		ps=ps2=0;
		for (int j=0;j<=sz[i<<1]+sz[i<<1|1];++j)
		{
			if (j)
			{
				if (ps!=p[i<<1].size()&&(ps2==p[i<<1|1].size()||p[i<<1][ps]>p[i<<1|1][ps2])) ps++;
				else ps2++;
			}
			A[i][j]=ps,B[i][j]=ps2;
		}
		A[i][sz[i]]=sz[i<<1],B[i][sz[i]]=sz[i<<1|1];
	}
	q=read();
	for (int i=1;i<=q;++i)
	{
		op=read(),x=read(),y=read();
		if (op==1)
		{
			if (y==1) used[x]=1;
			else used2[x]=1,cnt++;
			F[x]=1ll*(!used[x])*inv[1+used2[x]]%mod,change(x);
		}
		else if (op==2)
		{
			if (y==1) used[x]=0;
			else used2[x]=0,cnt--;
			F[x]=1ll*(!used[x])*inv[1+used2[x]]%mod,change(x);
		}
		else
		{
			if (!LENG(x,num[y])) puts("0");
			else printf("%d\n",calc(x,y));
		}
	}
	return 0;
}