#include <iostream>
#include <vector>
#include <algorithm>

#define INFTY (1<<30)

int main() {
	int n;
	std::cin >> n;
	std::vector<int> S((1<<n)+1), T((1<<n)+1), ans;
	for( int i = 0; i < (1<<n); ++i )
		std::cin >> S[i];
	std::sort( S.rbegin(), S.rend() );
	for( int k = n; k > 0; --k ) {
		S[1<<k] = -INFTY;
		int x = S[(1<<k)-2], u = 0, l = 1, t = 0;
		while( l < (1<<k) ) {
			while( S[u] == -1 ) ++u;
			while( S[l]+x > S[u] ) ++l;
			if( S[l]+x < S[u] ) { 
				std::cout << "impossible" << std::endl; 
				return 0;
			}
			T[t++] = S[l];
			S[l++] = -1;
			++u;
		}
		ans.push_back(x);
		swap(S,T);
	}
	for( int x : ans )
		std::cout << x << std::endl;
}