#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ls (rt<<1)
#define rs (rt<<1|1)
inline int qread()
{
    int a=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
    return a*f;
}
int n,m,h,a[300010],b[300010],OP[500010],X[500010],Y[500010],ans[500010],dp[300010];
vector<int>S[300010],s;
multiset<int>st;
struct bit
{
    int val[1000010],V=1000000;
    inline void adds(int p,int x){for(;p<=V;p+=p&-p)val[p]+=x;return ;}
    inline int Qs(int p){int an=0;for(;p;p-=p&-p)an+=val[p];return an;}
}t;
inline void dfs(int rt)
{
    if(rt>n)return ;b[rt]=a[rt];
    for(int i:S[rt])s.emplace_back(i);
    dfs(ls);dfs(rs);
    return ;
}
inline int get_pos(int rt)
{
	if(!b[rt])return 0;
    while(ls<=n)
    {
        if(!b[ls]&&!b[rs])break;
        if(b[ls]>b[rs])rt=ls;
        else rt=rs;
    }
    return rt;
}
inline void POP(int rt)
{
    b[rt]=0;
    while(ls<=n)
    {
        if(!b[ls]&&!b[rs])break;
        if(b[ls]>b[rs])swap(b[rt],b[ls]),rt=ls;
        else swap(b[rt],b[rs]),rt=rs;
    }
    return ;
}
inline int qpow(long long x,int y)
{
    long long cx=1;
    while(y)
    {
        (y&1)&&((cx*=x)%=mod);
        (x*=x)%=mod;
        y>>=1;
    }
    return cx;
}
inline void solve(int rt)
{
    s.clear();
    dfs(rt);
    int p=get_pos(rt);
    while(p)
    {
        dp[p]=b[rt];
        POP(rt);
        p=get_pos(rt);
    }
    sort(s.begin(),s.end());
    for(int i:s)
    {
        if(OP[i]==1)
        {
            if(Y[i]==1)st.insert(dp[X[i]]);
            else t.adds(dp[X[i]],1);
        }
        else if(OP[i]==2)
        {
            if(Y[i]==1)st.erase(st.find(dp[X[i]]));
            else t.adds(dp[X[i]],-1);
        }
        else if(X[i]==rt)
        {
            int A=(st.empty()?0:*st.rbegin()),B=t.Qs(Y[i]),C=t.Qs(Y[i]-1);
            if(A>Y[i])ans[i]=0;
            else if(A==Y[i])ans[i]=qpow(2,B);
            else ans[i]=1ll*(qpow(2,(B-C))-1+mod)*qpow(2,C)%mod;
        }
    }
    reverse(s.begin(),s.end());
    for(int i:s)
    {
        if(OP[i]==2)
        {
            if(Y[i]==1)st.insert(dp[X[i]]);
            else t.adds(dp[X[i]],1);
        }
        else if(OP[i]==1)
        {
            if(Y[i]==1)st.erase(st.find(dp[X[i]]));
            else t.adds(dp[X[i]],-1);
        }
    }
    return ;
}
int main()
{
    h=qread();n=(1<<h)-1;
    for(int i=1;i<=n;++i)a[i]=qread();
    m=qread();
    for(int i=1;i<=m;++i)
    {
        OP[i]=qread(),X[i]=qread(),Y[i]=qread();
        S[X[i]].emplace_back(i);
    }
    for(int i=1;i<=n;++i)solve(i);
    for(int i=1;i<=m;++i)if(OP[i]==3)printf("%d\n",ans[i]);
    return 0;
}