#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
template <class T ENABLE_IF_INT>
constexpr T INF = numeric_limits<T>::max() >> 1;
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define For(i, j, k) for (decltype(j - k) i = (j); i <= (k); ++i)     // NOLINT
#define ForDown(i, j, k) for (decltype(j - k) i = (j); i >= (k); --i) // NOLINT
#define pb push_back
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
#define lg(x) (31 ^ __builtin_clz((x)))
#define lgll(x) (31ll ^ __builtin_clzll((x)))
template<typename T> constexpr il T sq(const T & x){ return x * x; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y);}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y, T mod){T ans = 1; x %= mod; while (y) { if(y & 1)(ans *= x) %= mod;(x *= x) %= mod; y >>= 1;} return ans;}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y){T ans = 1; while (y) {if(y & 1) ans *= x;x *= x;y >>= 1;} return ans;}
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while(!isdigit(c)) {if (c == '-') f = -1;c = getchar();} while(isdigit(c)) {x = x * 10 + c - '0';c = getchar();} x *= f;}
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x); read(y...); }
int gcd(int a, int b) { if (!a | !b) return a + b; int az = __builtin_ctz(a); int bz = __builtin_ctz(b); int z = min(az, bz); a >>= az, b >>= bz; while (a != b) { int diff = b - a; az = __builtin_ctz(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
ll gcd(ll a, ll b) { if (!a | !b) return a + b; ll az = __builtin_ctzll(a); ll bz = __builtin_ctzll(b); ll z = min(az, bz); a >>= az, b >>= bz; while (a != b) { ll diff = b - a; az = __builtin_ctzll(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = (1 << 18) + 5;
int h, N, Q, a[MAXN], b[MAXN];
set<int> s[2];
bool vis[MAXN];
void dfs(int x) {
  auto check = [&](int x) -> bool {
    if (!b[x])
      return 0;
    while ((x << 1) <= N) {
      if (!b[x << 1] && !b[x << 1 | 1])
        break;
      if (b[x << 1] > b[x << 1 | 1])
        x <<= 1;
      else
        (x <<= 1) |= 1;
    }
    return !vis[x];
  };
  auto shiftDown = [&](int x) -> void {
    b[x] = 0;
    while ((x << 1) <= N) {
      if (!b[x << 1] && !b[x << 1 | 1])
        break;
      if (b[x << 1] > b[x << 1 | 1])
        swap(b[x], b[x << 1]), x <<= 1;
      else
        swap(b[x], b[x << 1 | 1]), (x <<= 1) |= 1;
    }
  };
  while (check(x)) {
    shiftDown(x);
  }
  if ((x << 1) <= N)
    dfs(x << 1), dfs(x << 1 | 1);
}
il void Main() {
  read(h), N = (1 << h) - 1;
  For(i, 1, N) read(a[i]);
  read(Q);
  while (Q--) {
    int op, x, y;
    read(op, x, y);
    fill(vis + 1, vis + 1 + N, 0);
    if (op == 1)
      s[y - 1].emplace(x);
    else if (op == 2)
      s[y - 1].erase(x);
    else {
      int maxv = (1 << s[1].size()) - 1, Ans = 0;
      for (int i : s[0])
        vis[i] = 1;
      For(S, 0, maxv) {
        for (auto [j, k] = mkp(s[1].begin(), 0); j != s[1].end(); ++j, ++k)
          if (S >> k & 1)
            vis[*j] = 1;
        copy(a + 1, a + 1 + N, b + 1);
        dfs(1), Ans += b[x] == y;
        for (auto [j, k] = mkp(s[1].begin(), 0); j != s[1].end(); ++j, ++k)
          if (S >> k & 1)
            vis[*j] = 0;
      }
      cout << Ans << '\n';
    }
  }
}
} // namespace

signed main() { return Main(), 0; }