#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using u64=unsigned long long;
using LF=long double;
#define F(i,l,r) for(int i=l;i<=r;++i)
#define G(i,r,l) for(int i=r;i>=l;--i)
#define CT const&
#define IL inline
#define PB push_back
template<class T>
IL void tomn(T &x,T CT y){y<x?x=y,0:0;}
template<class T>
IL void tomx(T &x,T CT y){y>x?x=y,0:0;}
#define DEBUG(x) cerr<<"line:"<<__LINE__<<" "#x"="<<x<<endl
#define CUT cerr<<"**********\n"
const LF EPS=1e-10L;
IL int dcmp(LF x){return fabs(x)<=EPS?0:(x<0?-1:1);}
//const LL INF=4e18L;

const int N=500500,INF=1.02e9,P=1000000007;
struct D{
	int x,i;
};
bool operator<(D x,D y){return x.x<y.x;}
class Seg{
	D mn[4*N];
	int n;
public:
	void build(int n_,int *a_){
		n=1<<__lg(2*n_+3);
		F(i,0,2*n)mn[i]=D{INF};
		F(i,1,n_)mn[i+n]=D{a_[i],i};
		G(i,n-1,1)mn[i]=min(mn[i<<1],mn[(i<<1)|1]);
	}
	void upd(int i,D x){
//		for(i+=n;i;i>>=1)
//			mn[i]=x,tomn(x,mn[i^1]);
		i+=n,mn[i]=x;
		for(i>>=1;i;i>>=1)
			mn[i]=min(mn[i<<1],mn[i<<1|1]);
	}
	D qry(int l,int r){
		D x{INF},y{INF};
		for(l+=n-1,r+=n+1;l^r^1;l>>=1,r>>=1)
			(l&1)?void():tomn(x,mn[l^1]),(r&1)?tomn(y,mn[r^1]):void();
		return min(x,y);
	}
}sol;
int h,a[N],l[N],r[N],n,b[N],c[N];
vector<int> t[N];
bool vis[2][N],ins[N];
LL ans;
void dfs1(int u){
	static int tim;
	l[u]=r[u]=++tim,b[l[u]]=a[u];
	for(int v:t[u])dfs1(v),r[u]=tim;
}
bool dfs(int u){
	bool flag=0;
	int mx=0;
	for(int v:t[u])flag|=dfs(v),tomx(mx,c[v]);
	sol.upd(l[u],D{a[u],l[u]});
	c[u]=0;
	if(flag|=ins[u]){
		D d;
		while(d=sol.qry(l[u],r[u]),d.x<mx)sol.upd(d.i,D{INF});
		c[u]=d.x,sol.upd(d.i,D{INF});
	}return flag;
}
void solve(int i,int x,int y){
	if(i>n){
		
//		if(ins[2]==1)
//			cout<<"!!!\n";
		
		sol.build(n,b);
		F(j,1,n)c[j]=0;
		dfs(1),(ans+=(c[x]==y))%=P;
		
//		cout<<"ins:";F(i,1,n)cout<<ins[i]<<" ";cout<<endl;
//		cout<<"c:  ";F(i,1,n)cout<<c[i]<<" ";cout<<endl;
		
		return;
	}
	if(!vis[0][i])ins[i]=0,solve(i+1,x,y);
	if(vis[1][i]|vis[0][i])ins[i]=1,solve(i+1,x,y);
}
int main(){
#ifdef LOCAL
	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
#endif
	scanf("%d",&h),n=(1<<h)-1;
	F(i,1,n)scanf("%d",a+i);
	F(i,1,(1<<(h-1))-1)
		t[i].PB(2*i),t[i].PB(2*i+1);
	int q;scanf("%d",&q),dfs1(1);
	while(q--){
		int t,x,y;
		scanf("%d%d%d",&t,&x,&y);
		if(t==1)vis[y-1][x]=1;
		else if(t==2)vis[y-1][x]=0;
		else ans=0,solve(1,x,y),printf("%lld\n",ans);
	}
}