1
2
#include<bits/stdc++.h>
using namespace std;int n,v,i=1;multiset<int>e[20009];int F(int w){for(;!e[w].empty();F(v))e[w].erase(e[w].find(v=*e[w].begin()));cout<<w%2;}main(){cin>>n;n=1<<(n-1);for(n--;i<=n;i++)e[i].insert((i*2)&n),e[i].insert((i*2+1)&n);e[0].insert(1);F(0);}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX