#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define tern(cond, a, b) (cond ? a : b)
typedef long long lint;
typedef pair<lint,lint> ii;
vector<int> original;
vector<int> arr[140005];
vector<int> nxt;
vector<int> temp;
lint ans = 1152921504606846976LL;
lint res = 0;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
int N = (1<<n);
original.resize(N);
for(int i = 0;i < N;i++) cin >> original[i];
if(n == 0){
cout << 0;
return 0;
}
int bestiter = -1; vector<int> bestflips;
for(int iter = 0;iter < n;iter++){
for(int i = 0;i < N;i++) arr[i].clear();
for(int i = 0;i < N;i++) arr[i].push_back(original[i]);
res = 0;
vector<int> flips;
for(lint gap = 1;gap < N;gap *= 2){
lint invcnt = 0;
lint total = 0;
for(int s = 0;s < N;s += 2*gap){
int m = s+gap;
lint l = 0;
for(int r : arr[m]){
while(l < sz(arr[s])){
if(arr[s][l] > r) break;
else l++;
}
invcnt += (gap-l);
}
total += gap*gap;
swap(temp, arr[s]);
arr[s].resize(sz(temp) + sz(arr[m]));
merge(all(temp), all(arr[m]), arr[s].begin());
temp.clear();
}
//if(iter == 0) show(invcnt);
if(total-invcnt < invcnt){
res += total-invcnt;
flips.push_back(1);
}
else{
res += invcnt;
flips.push_back(0);
}
}
//reverse(all(flips));
if(ans > res){
ans = res;
bestiter = iter;
bestflips = flips;
}
nxt.clear();
for(int i = 0;i < N;i += 2) nxt.push_back(original[i]);
for(int i = 1;i < N;i += 2) nxt.push_back(original[i]);
swap(nxt, original);
}
string S = "";
for(int i = 0;i < bestiter;i++) S += "2";
for(int i = 0;i < n;i++){
//show(bestflips[i]);
if(bestflips[i]) S += "1";
S += "2";
}
reverse(all(S));
cout << ans << '\n';
cout << S;
}
