// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,i) (((s)>>(i))&1)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=2e5+3;
// clang-format on
int n,m,a[N];
bool vis[N][2];
int ans[N<<1];
int D,top;
inline void dfs(int u){
	if(!vis[u][0]){
		vis[u][0]=1;
		dfs((u<<1|0)&((1<<D)-1));
		a[++top]=0;
	}
	if(!vis[u][1]){
		vis[u][1]=1;
		dfs((u<<1|1)&((1<<D)-1));
		a[++top]=1;
	}
}
vector<int>vec[N];
vector<int>ed;
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	n=read();
	if(n==1){puts("1");return 0;}
	if(n==2){puts("01");return 0;}
	for(;(1<<m)+m-1<=n;++m);--m;
	int tot=0;
	top=0,D=m-1,dfs(0);
	per(i,top,1)ans[++tot]=a[i];
	memset(vis,0,sizeof vis);
	rep(i,1,tot){
		int u=0;
		rep(j,i-m+1,i)u=u<<1|(j>=1?ans[j]:0);
		vis[u][ans[i+1]]=1;
	}
	D=m;
	int cnt=tot;
	rep(i,1,INT_MAX){
		int u=0;
		rep(j,i-m+1,i)u=u<<1|(j>=1?ans[j]:0);
		top=0,dfs(u);
		per(j,top,1)vec[i].pb(a[j]);
		if((cnt+=top)>=n-m){
			per(j,m-1,0)ed.pb(bit(ans[i],j));
			rep(j,i+1,tot)ed.pb(ans[j]);
			rep(j,1,i){
				ed.pb(ans[j]);
				for(auto x:vec[j])ed.pb(x);
			}
			ed.resize(n);
			break;
		}
	}
	for(auto x:ed)printf("%d",x);
}