/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";


int n;
int a[1 << 18];
vector<int> t;
int res = 0;
pair<int, int> opt[20][1 << 18];
int mask = 0;
int fs[20], fs1[20];
int rest[1 << 18];
int last;
pair<int, int> good[1 << 18][20];
pair<int, int> good1[1 << 18][20];


void check1(int i) {
    if (true) {
        int a = opt[last][mask].first;
        if (fs[last] < a) {
            fs1[last] = fs[last];
            fs[last] = a;
        } else {
            chkmax(fs1[last], a);
        }
    }
    if (true) {
        int a = opt[last][mask].second;
        if (fs[last] < a) {
            fs1[last] = fs[last];
            fs[last] = a;
        } else {
            chkmax(fs1[last], a);
        }
    }
}


void check(int i) {
    if (i == sz(t)) {
        //cout << mask << endl;
        return;
    }
    if (!t[i]) {
        check(i + 1);
    } else {
        mask |= (1 << i);
        check(i + 1);
        mask ^= (1 << i);
        int nlast = last;
        last = i + 1;
        check1(sz(t));
        last = nlast;
    }
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
    cin >> n;
    for (int i = 0; i < (1 << n); i++) {
        cin >> a[i];
    }
    for (int i = 0; i < (1 << n); i++) {
        t.clear();

         for (int ts1 = 0; ts1 <= n; ts1++) {
            int cur = i;
            for (int ts = ts1; ts < n; ts++) {
                if (i & (1 << ts)) {
                    cur ^= (1 << ts);
                    if (true) {
                        int a = good[cur][ts + 1].first;
                        if (good[i][ts1].first < a) {
                            good[i][ts1].second = good[i][ts1].first;
                            good[i][ts1].first = a;
                        } else {
                            chkmax(good[i][ts1].second, a);
                        }
                    }
                    if (true) {
                        int a = good[cur][ts + 1].second;
                        if (good[i][ts1].first < a) {
                            good[i][ts1].second = good[i][ts1].first;
                            good[i][ts1].first = a;
                        } else {
                            chkmax(good[i][ts1].second, a);
                        }
                    }
                    cur ^= (1 << ts);
                }
            }
            if (true) {
                if (good[i][ts1].first < a[i]) {
                    good[i][ts1].second = good[i][ts1].first;
                    good[i][ts1].first = a[i];
                } else {
                    chkmax(good[i][ts1].second, a[i]);
                }
            }
        }
        if (good[i][0].first && good[i][0].second) {
            chkmax(res, good[i][0].first + good[i][0].second);
        }
        for (int t = 1; t <= n; t++) {
            if (fs[t] && fs1[t]) {
                chkmax(res, fs[t] + fs1[t]);
            }
        }
        if (i) {
            cout << res << '\n';
        }
    }
}


Measured memory_bytes: 48128