#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
// #define int long long

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int n; cin >> n;
	vector<pair<int,int>> vec;
	for(int i = 0; i < (1 << n); i += 2) {
		int x, y; cin >> x >> y;
		if(x > y) vec.push_back({x, i});
		else vec.push_back({y, i + 1});
		if(n == 1) {
			if(x < y) cout << 1 << endl;
			else cout << 2 << endl;
			return 0;
		}
	}
	while(vec.size() != 2) {
		vector<pair<int,int>> temp;
		for(int i = 0; i < vec.size(); i += 2) {
			temp.push_back(max(vec[i], vec[i + 1]));
		}
		vec = temp;
	}
	if(vec[0].first > vec[1].first) cout << vec[1].second + 1 << endl;
	else cout << vec[0].second + 1 << endl;
	


	return 0;
}
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vlll = vector<vll>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.second < secondElof.second;
}
//AtCoder以外ではコメントアウトを忘れずに！
//#include <atcoder/all>
//using namespace atcoder;
//**Snippetリスト**//
//rep, vin, all, iteLoop, bitSearch, bitList, nod, LIS, digitDP, treeDP, Rerooting//
//gcdlcm, isPrime, eratos, primeFactorize, Npow, combination, divisor, modinv, doubling//
//dfs, bfs, dijkstra, WarshallFloyd, BellmanFord, UnionFind, Kruskal, RMQ, LCA, FordFulkerson//
//**AC Libraryリスト**//
//pow_mod, inv_mod, floor_sum, convolution, convolution_ll, modint//
//fenwicktree, segtree, lazysegtree, string//
ll i, j, k, l; ll N, M, K, H, W, X, Y, Z, R, Q, T;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vl D; vector<vpll> path;
//***********//
int main() {
	cin >> N;
	vpll A(pow(2, N));
	for (i = 0; i < pow(2,N); i++) {
		ll a;
		cin >> a;
		A[i] = mp(a, i+1);
	}
	for (i = 1; i <= N-1; i++) {
		vpll B;
		for (j = 1; j <= pow(2,N-i); j++) {
			if (A[2 * j - 2].first < A[2 * j - 1].first) {
				B.pb(A[2 * j - 1]);
			}
			else {
				B.pb(A[2 * j - 2]);
			}
		}
		A = B;
		//debug(A.size());
		B.clear();
	}
	if (A[0].first < A[1].first) {
		cout << A[0].second;
	}
	else {
		cout << A[1].second;
	}
}
