#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
const int N=(1<<17)+5,oo=1e9,mod=998244353;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}
inline void add(int&x,int y) {x=(x+y>=mod?x+y-mod:x+y);}

int n,a[N],b[N],t[N][2],ID,Pos;ll T[2],ans=1ll<<60;
inline void solve(int O) {
    ll sum=0; int id=0;
    for(int o=n;o>=1;--o) {
        for(int i=0;i<(1<<n);++i)
            if((b[i]>>(o-1))&1) {
                T[0]+=t[b[i]>>o][0];
                ++t[b[i]>>o][1];
            } else {
                T[1]+=t[b[i]>>o][1];
                ++t[b[i]>>o][0];
            }
        if(T[0]<T[1]) {
            sum+=T[0];
            id|=(1<<(o-1));
        } else {
            sum+=T[1];
        }
        for(int i=0;i<(1<<(n-o));++i) t[i][0]=t[i][1]=0;
        T[0]=T[1]=0;
    }
    if(ans>sum) {
        ans=sum;
        Pos=O;
        ID=id;
    }
}
int vc[N];
inline void add(int V) {vc[++vc[0]]=V;}
inline void print() {for(int i=1;i<=vc[0];++i) putchar('0'+vc[i]);}
int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif
    n=read();
    for(int i=0;i<(1<<n);++i) a[read()]=i;
    if(n==0) {
        printf("0\n");
        return 0;
    }
    for(int o=0;o<n;++o) {
        for(int i=0;i<(1<<n);++i) {
            b[i]=0;
            for(int j=o-1;j>=0;--j) b[i]=2*b[i]+((a[i]>>j)&1);
            for(int j=n-1;j>=o;--j) b[i]=2*b[i]+((a[i]>>j)&1);
        }
        solve(o);
    }
    for(int i=1;i<=Pos;++i) add(2);
    add(2);
    for(int i=0;i<n;++i) {
        if((ID>>i)&1) add(1);
        if(i!=n-1)add(2);
    }
    printf("%lld\n",ans);
    print();
    return 0;
}