#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<random>
#include<chrono>
#include<bitset>
#include<map>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#define eb emplace_back

using namespace std;
const int maxn=(1<<18)+10, maxm=11+10, inf=2e9+10, P=1e9+7;
const double eps=1e-10, pi=acos(-1.0);
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, LL> pll;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}
mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());
inline int ksm(int x, int y) {
	int s=1;
	for(; y; y>>=1, x=1LL*x*x%P)
		if(y&1) s=1LL*s*x%P;
	return s;
}
inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
LL gcd(LL x, LL y) {return y?gcd(y, x%y):x;}

int h, a[maxn], b[maxn], rk[20][maxn], dep[maxn], val[20][maxn];

inline int down(int x) {
	a[x]=0;
	while(x+x<(1<<h)) {
		if(a[x<<1]==0&&a[x<<1|1]==0) break;
		if(a[x<<1]<a[x<<1|1]) swap(a[x], a[x<<1|1]), x=(x<<1|1);
			else swap(a[x], a[x<<1]), x=(x<<1);
	}
	return x;
}
int tr[2][20][maxn];
inline void modify(int bel, int p, int id, int u, int t) {//id start from 0
	for(int i=u; i<(1<<(h-p+1)); i+=(i&(-i))) 
		tr[bel][p][i+id*((1<<(h-p+1))-1)]+=t;
}
inline int getsum(int bel, int p, int id, int u) {
	int s=0;
	for(int i=u; i>0; i-=(i&(-i))) s+=tr[bel][p][i+id*((1<<(h-p+1))-1)];
	return s;
}

int pos[1000010], pw[maxn];
int main() {
	h=read();
	for(int i=1; i<(1<<h); ++i) a[i]=b[i]=read(), dep[i]=dep[i>>1]+1, pos[a[i]]=i;
	sort(b+1, b+(1<<h));
	for(int i=1; i<(1<<h); ++i) a[i]=lower_bound(b+1, b+(1<<h), a[i])-b;
	for(int i=1; i<(1<<h); ++i) b[i]=a[i];
	for(int p=1; p<=h; ++p) {
		for(int i=1; i<(1<<h); ++i) a[i]=b[i];
		for(int i=(1<<(p-1)); i<(1<<p); ++i) {
			for(int j=1; j<(1<<(h-p+1)); ++j) {
				val[p][a[i]]=j;
				int x=down(i);
				rk[p][x]=j; 
			}
		}
		//for(int i=1; i<(1<<h); ++i)
		//	if(rk[p][i]>0)
		//		printf("rk[%d][%d]=%d\n", p, i, rk[p][i]);
		//for(int i=1; i<(1<<h); ++i)
		//	if(val[p][i]>0)
		//		printf("val[%d][%d]=%d\n", p, i, val[p][i]);
	}
	for(int p=1; p<=h; ++p) {
		for(int x=1; x<(1<<h); ++x)
			if(rk[p][x]!=0&&rk[p][x>>1]!=0)
				rk[p][x]=min(rk[p][x], rk[p][x>>1]);
	}
	int q=read();
	pw[0]=1;
	for(int i=1; i<(1<<h); ++i) pw[i]=2LL*pw[i-1]%P;
	while(q--) {
		int ty=read(), x=read(), y=read();
		if(ty==1) {
			--y; int t=x;
			while(x) {
				modify(y, dep[x], x-(1<<(dep[x]-1)), rk[dep[x]][t], 1);
				x>>=1;
			}
		} else if(ty==2) {
			--y; int t=x;
			while(x) {
				modify(y, dep[x], x-(1<<(dep[x]-1)), rk[dep[x]][t], -1);
				x>>=1;
			}
		} else if(ty==3) {
			if(pos[y]==0) {puts("0"); continue;}
			y=val[dep[x]][b[pos[y]]];
		//	printf("y=%d\n", y);
			if(y==0) {puts("0"); continue;}
			int t=getsum(0, dep[x], x-((1<<(dep[x]-1))), y-1);
		//	printf("t=%d\n", t);
			if(t>0) {puts("0"); continue;}
			t=getsum(0, dep[x], x-((1<<(dep[x]-1))), y);
		//	printf("t=%d\n", t);
		//	printf("o=%d\n", getsum(1, dep[x], x-((1<<(dep[x]-1))), y)-getsum(1, dep[x], x-((1<<(dep[x]-1))), y-1));
			if(t+getsum(1, dep[x], x-((1<<(dep[x]-1))), y)-getsum(1, dep[x], x-((1<<(dep[x]-1))), y-1)==1) {
				printf("%d\n", pw[getsum(1, dep[x], x-((1<<(dep[x]-1))), (1<<(h-dep[x]+1))-1)-getsum(1, dep[x], x-((1<<(dep[x]-1))), y)]);
			} else puts("0");
		}
	}
	return 0;
}