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

#define rep(i, a, b) for (auto i = a; i < (b); ++i)
#define repr(i, a, b) for (auto i = (a) - 1; i >= (b); --i)
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<pii>;

template<class T>
inline bool cmax(T &a, const T& b) {
    return a < b ? a = b, 1 : 0;
}

template<class T>
inline bool cmin(T &a, const T &b) {
    return b < a ? a = b, 1 : 0;
}

const int inf = 0x3f3f3f3f;
const ll linf = 1e18;
const double dinf = numeric_limits<double>::infinity();

struct Line {
    mutable ll k, m, p;
    bool operator<(const Line &o) const {
        return k < o.k;
    }
    bool operator<(ll x) const {
        return p < x;
    }
};
struct LineContainer : multiset<Line, less<> >{
    static const ll inf = LLONG_MAX;
    ll div(ll a, ll b) {
        return a / b - ((a ^ b) < 0 && a % b);
    }
    bool isect(iterator x, iterator y) {
        if (y == end())
            return x->p = inf, 0;
        if (x->k == y->k)
            x->p = x->m > y->m ? inf : -inf;
        else
            x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    void add(ll k, ll m) {
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isect(y, z))
            z = erase(z);
        if (x != begin() && isect(--x, y))
            isect(x, y = erase(y));
        while ((y = x) != begin() && (--x)->p >= y->p)
            isect(x, erase(y));
    }
    ll query(ll x) {
        assert(!empty());
        auto l = *lower_bound(x);
        return l.k * x + l.m;
    }
};

int n;
vll s;
map< tuple<int, int, int>, ll> mem;

ll dp(int l, int r, int k) {
    if (mem.contains({l, r, k})) {
        return mem[{l, r, k}];
    }
    int m = (l + r) / 2;
    LineContainer lc;
    
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    cin >> n;

    s.resize(1 << n);
    rep(i, 0, 1 << n) {
        cin >> s[i];
    }

    vector<vll> dp(n + 1);
    // vector< vector<vll> > dp(n + 1);
    dp[0].assign(1 << n, 0);

    rep(i, 1, n + 1) {
        dp[i].resize(1 << n);
        for (int l = 0, pos = 0; l < (1 << n); l += (1 << i), ++pos) {
            // dp[i].eb(1 << i, linf);

            int r = l + (1 << i);
            int m = (l + r) / 2;

            vi ord(r - l);
            iota(all(ord), l);
            sort(all(ord), [&](int a, int b) { 
                return s[a] > s[b];
            });
            {
                multiset<ll> st;
                rep(j, m, r) {
                    st.insert(dp[i - 1][j]);
                }
                LineContainer lc;
                for (auto &j : ord) {
                    if (j < m) {
                        // if (!lc.empty()) ll askjf = -lc.query(s[j]);
                        dp[i][j] = dp[i - 1][j] + min(lc.empty() ? linf : (-lc.query(s[j]) + s[j] * s[j]), st.empty() ? linf : *st.begin());
                    } else {
                        st.erase(st.find(dp[i - 1][j]));
                        // cerr << (2 * s[j]) << ' ' << -(dp[i - 1][j] + s[j] * s[j]) << endl;
                        lc.add((2 * s[j]), -(dp[i - 1][j] + s[j] * s[j]));
                    }
                }
            }
            {   
                multiset<ll> st;
                rep(j, l, m) {
                    st.insert(dp[i - 1][j]);
                }
                LineContainer lc;
                for (auto &j : ord) {
                    if (j >= m) {
                        dp[i][j] = dp[i - 1][j] + min(lc.empty() ? linf : (-lc.query(s[j]) + s[j] * s[j]), st.empty() ? linf :*st.begin());
                    } else {
                        st.erase(st.find(dp[i - 1][j]));
                        lc.add((2 * s[j]), -(dp[i - 1][j] + s[j] * s[j]));
                    }
                }
            }   
        }
    }
    cout << dp[n][0] << '\n';

    // rep(i, 0, n + 1) {
    //     rep(j, 0, 1 << n) {
    //         cerr << dp[i][j] << ' ';
    //     }
    //     cerr << endl;
    // }

    return 0;
}