#include <bits/stdc++.h>

using namespace std;

struct coty
{
	long long idx, data;
}a[100005];

int n;

int cmp(coty a, coty b)
{
	return a.data > b.data;
}

int main()
{
	cin >> n;
	for (long long i = 1 ; i <= (1 << n) ; i ++)
	{
		cin >> a[i].data;
		a[i].idx = i;
	}
	sort (a + 1, a + 1 + (1 << n) / 2, cmp);
	sort (a + 1 + (1 << n) / 2, a + (1 << n) + 1, cmp);
	if (a[1].data >= a[(1 << n)].data)
	{
		cout << a[(1 << n)].idx;
	}
	else
	{
		cout << a[1].idx;
	}
	return 0;
}