#include<bits/stdc++.h>
using namespace std;
int t,k,vis[3001],dis[3001],p[3001],q[3001];
vector <pair<int,int>> G[3001];
int check(){
	queue <int> q;
	for(int i=0;i<1<<k;i++) vis[i]=0,dis[i]=1e9,G[i].clear();
	for(int i=0;i<1<<k;i++){
		for(int j:{0,1}){
			int u=i*2+j,v=u&((1<<k)-1);
			if(p[u]!=-1){
				G[i].push_back({v,p[u]-j});
				G[v].push_back({i,j-p[u]});
			}
			else{
				G[i].push_back({v,1-j});
				G[v].push_back({i,j});
			}
		}
	}
	q.push(0),dis[0]=0;
	while(q.size()&&dis[0]>=0){
		int x=q.front();
		q.pop();
		vis[x]=0;
		for(auto [y,w]:G[x]){
			if(dis[y]>dis[x]+w){
				dis[y]=dis[x]+w;
				if(!vis[y]) q.push(y),vis[y]=1;
			}
		}
	}
	return dis[0]>=0;
}
int calc(){
	for(int i=0;i<1<<k+1;i++) p[i]=q[i];
	if(check()) return 1;
	if(!q[(1<<k+1)-1]){
		p[(1<<k+1)-1]=1;
		if(check()) return 1;
	}
	for(int i=(1<<k+1)-1;i>0;i--){
		p[i]=-1;
		if(!q[i-1]) p[i-1]=1;
		if(!q[i-1]&&check()){
			for(int j=i;j<(1<<k+1);j++){
				p[j]=0;
				if(!check()) p[j]=1;
			}
			return 1;
		}
	}
	return 0;
}
int main(){
	scanf("%d",&k),k*=2;
	for(int i=0;i<1<<k+1;i++) scanf("%1d",&q[i]);
	if(!calc()) printf("no");
	else for(int i=0;i<1<<k+1;i++) printf("%d",p[i]);
	return 0;
}