#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr Int INF = 1001001001001001001LL;

int N;
vector<Int> C;

vector<Int> ds;
void pull(int a) {
  ds[a] = (a < 1 << N) ? min(C[a], ds[a << 1] + ds[a << 1 | 1]) : C[a];
}

int main() {
  for (; ~scanf("%d", &N); ) {
    C.assign(1 << (N+1), INF);
    for (int a = 1; a < 1 << (N+1); ++a) {
      scanf("%lld", &C[a]);
    }
    
    ds.assign(1 << (N+1), INF);
    for (int a = 1 << (N+1); --a; ) pull(a);
    
    int Q;
    scanf("%d", &Q);
    for (int q = 0; q < Q; ++q) {
      int O;
      scanf("%d", &O);
      if (O == 1) {
        int J;
        Int X;
        scanf("%d%lld", &J, &X);
        C[J] = X;
        for (int a = J; a; a >>= 1) pull(a);
      } else if (O == 2) {
        int S[2];
        scanf("%d%d", &S[0], &S[1]);
        Int ans = INF;
        // at endpoints of interval as[i]
        int as[2];
        Int cost[2][2];
        for (int i = 0; i < 2; ++i) {
          if (S[i] < 1 << N) {
            as[i] = (1 << N) + S[i];
            cost[i][0] = 0;
            cost[i][1] = ds[as[i]];
          } else {
            as[i] = (1 << (N+1)) - 1;
            cost[i][0] = ds[as[i]];
            cost[i][1] = 0;
          }
        }
        for (; ; ) {
          for (int j = 0; j < 2; ++j) for (int k = 0; k < 2; ++k) {
            if (as[0] + j == as[1] + k) {
              chmin(ans, cost[0][j] + cost[1][k]);
            }
          }
          if (as[0] == 1) break;
          // up
          for (int i = 0; i < 2; ++i) {
            cost[i][(as[i] ^ 1) & 1] += ds[as[i] ^ 1];
            as[i] >>= 1;
            chmin(cost[i][1], cost[i][0] + ds[as[i]]);
            chmin(cost[i][0], cost[i][1] + ds[as[i]]);
          }
        }
        printf("%lld\n", ans);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}