#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
int poz[(1 << 18)+1];
int zlicz_kombi[(1 << 18)+1];
pair<ll,string> solve2(int n, int m)
{
string moves = "";
ll inv = 0;
rep(bit,m)
{
rep(bit2,(1 << (bit+1)))
{
zlicz_kombi[bit2] = 0;
}
ll w1 = 0, w2 = 0;
rep(i,n)
{
int kombi = poz[i] >> (m-bit-1);
// cout << poz[i] << " " << kombi << " " << w1 << " " << w2 << " poz\n";
if(kombi & 1)
{
w1 += zlicz_kombi[kombi^1];
}
else
{
w2 += zlicz_kombi[kombi^1];
}
zlicz_kombi[kombi]++;
}
/// cout << w1 << " " << w2 << " \n";
if(w1 < w2) moves += '1';
rep(i,m-1)moves += '2';
inv += min(w1,w2);
}
return {inv,moves};
}
void solve()
{
int n;
cin >> n;
//n--;
rep(i,(1 << n))
{
int a;
cin >> a;
poz[a] = i;
}
// cout << "xd\n";
int m = (1 << n);
pair<ll,string> wyn = {1e18,"xd"};
rep(i,n)
{
pair<ll,string> wyn2;
rep(j,i)
{
wyn.ss += '2';
}
pair<ll,string> wyn3 = solve2(m,n);
wyn2 = {wyn3.ff,wyn2.ss + wyn3.ss};
//cout << "\n\n\n";
wyn = min(wyn,wyn2);
rep(k,m)
{
if(poz[k] & 1) poz[k] = (poz[k] >> 1) ^ (1 << (n-1));
else poz[k] = (poz[k] >> 1);
}
}
cout << wyn.ff << "\n" << wyn.ss << "\n";
}
int main()
{
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int t = 1;
// cin >> t;
while(t--) solve();
}
