#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],st[1000001],u[1000001],v1[1000001],id[1000001],op;
long long t1=0,t2=0,g[1000001],vi[1000001],vv[1000001];
struct p{long long q,w;}l[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
bool ch(long long qq)
{
	if(!g[qq]) return 0;
	if(g[qq<<1]==0&&g[(qq<<1|1)]==0)
	{
		if(vv[qq]) return 0;
		return 1;
	}
	if(g[qq<<1]>g[qq<<1|1])
	{
		return ch(qq<<1);
	}
	else
	{
		return ch(qq<<1|1);
	}
}
void move(long long qq)
{
	if(g[qq<<1]==0&&g[(qq<<1|1)]==0)
	{
		g[qq]=0;
		return;
	}
	if(g[qq<<1]>g[qq<<1|1])
	{
		swap(g[qq],g[qq<<1]);
		move(qq<<1);
	}
	else
	{
		swap(g[qq],g[qq<<1|1]);
		move(qq<<1|1);
	}
}
int work()
{
	for(int i=1;i<(1<<a);i++)
	{
		g[i]=d[i];
	}
//	cout<<q<<" "<<vv[1]<<" "<<vv[2]<<" "<<vv[3]<<" "<<ch(1)<<"\n";
	while(ch(q)) move(q);
	return (g[q]==d[w]);
}
int main()
{
//	freopen("1.in","r",stdin);
	srand((unsigned)(time(0)^(*new int)));
	fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	T=1;
	scanf("%lld",&a);
	for(int i=1;i<(1<<a);i++)
	{
		d[i]=read();
		id[d[i]]=i;
	}
	scanf("%lld",&b);
	for(int ii=1;ii<=b;ii++)
	{
		op=read(),q=read(),w=read();
		if(op==1)
		{
			if(w==1)
			{
				v[q]=1,t1^=(1<<(q-1));
			}
			else
			{
				v1[q]=1,t2^=(1<<(q-1));
			}
		}
		else if(op==2)
		{
			if(w==1)
			{
				v[q]=0,t1^=(1<<(q-1));
			}
			else
			{
				v1[q]=0,t2^=(1<<(q-1));
			}
		}
		else
		{
			an=0;
			if(!id[w])
			{
				printf("0\n");continue;
			}w=id[w];
			for(int i=t2;;i=((i-1)&t2))
			{
				cn=0;
				for(int j=0;j+1<(1<<a);j++)
				{
					if(((1<<j)&i)||((1<<j)&t1)) st[++cn]=j+1;
				}
				for(int j=1;j<=cn;j++) vv[st[j]]=1;
				an+=work();
				for(int j=1;j<=cn;j++) vv[st[j]]=0;
				if(i==0) break;
			}
			printf("%lld\n",(an%mod+mod)%mod);
		}
	}
	return 0;
}