#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
int r, a[N], who[N << 2];
ll sum[N << 2];
ll get(int x, int y) {
	if(a[y] < a[x])
		return 0;
	return 1ll * (a[y] - a[x]) * (a[y] - a[x]);
}
void solve(int node, int s, int e) {
	if(s == e) {
		who[node] = s;
		sum[node] = 0;
		return;
	}
	int mid = s + e >> 1;
	solve(node << 1, s, mid);
	solve(node << 1 | 1, mid + 1, e);
	int left_winner = who[node << 1];
	int right_winner = who[node << 1 | 1];
	if(s == 1) {
		who[node] = 1;
		sum[node] = get(left_winner, right_winner);
	} else {
		if(a[left_winner] < a[1])
			who[node] = right_winner;
		else if(a[right_winner] < a[1])
			who[node] = left_winner;
		else {
			if(a[left_winner] > a[right_winner]) {
				who[node] = right_winner;
				sum[node] = get(right_winner, left_winner);
			} else {
				who[node] = left_winner;
				sum[node] = get(left_winner, right_winner);
			}
		}
	}
	sum[node] += sum[node << 1] + sum[node << 1 | 1];
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> r;
    for(int i = 1;i <= (1 << r);i++)
		cin >> a[i];
	solve(1, 1, (1 << r));
	cout << sum[1];
    return 0;
}