// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,k;
int vis[maxn],nxt[maxn];
int q[maxn],len;
void dfs(int u){
	if(vis[u])return;
	vis[u]=1;
	q[++len]=u;
	dfs((u*2+1)%(1<<k));
	dfs((u*2)%(1<<k));
}

int st[maxn],tp;
int cnt[maxn],cc;
void add(int x){
	x%=(1<<k);
	cc+=(!cnt[x]),++cnt[x];
}
void sub(int x){
	x%=(1<<k);
	--cnt[x],cc-=(!cnt[x]);
}
void print(int l,int r){
//	For(i,l,r) cout<<st[i]<<" ";puts("");
	Rep(i,k,0) cout<<(st[l]>>i&1);
	For(i,l+1,r) cout<<(st[i]&1);
	exit(0);
}
void print(){
	tp=0;
	For(i,0,(1<<(k+1))-1)vis[i]=0;
	for(int u=q[1];!vis[u];u=nxt[u]) st[++tp]=u,vis[u]=1;
	For(i,1,tp) st[i+tp]=st[i];
//	For(i,1,tp) cout<<st[i]<<" "; puts("");
	For(i,1,n-k) add(st[i]);
	if(cc==(1<<k)) print(1,n-k);
	For(i,n-k+1,tp*2){
		sub(st[i-(n-k)]);
		add(st[i]);
		if(cc==(1<<k)) print(i-(n-k)+1,i);
	}
	exit(233);
}

signed main()
{
	n=read();
	if(n==1)puts("0"),exit(0);
	while((1<<k)+k-1<=n)++k; --k;
	dfs(0);
	if(n==(1<<k)+k-1){
		For(i,1,k-1)cout<<0;
		For(i,1,len)cout<<q[i]%2;
		exit(0);
	}
	int mxs=(1<<(k+1));
	For(i,0,mxs-1)vis[i]=0,nxt[i]=-1;
//	For(i,1,len)cout<<q[i]<<" \n"[i==len];
	For(i,1,len){
		q[i]=q[i]*2+q[i+1]%2;
		vis[q[i]]=1;
	}
	For(i,1,len)nxt[q[i]]=q[i%len+1];
	For(i,0,mxs-1)if(nxt[i]==-1)nxt[i]=nxt[i^(1<<k)]^1;
//	For(i,1,len)cout<<q[i]<<" \n"[i==len];
//	For(i,0,mxs-1)cout<<nxt[i]<<" \n"[i==mxs-1];
	int sum=len;
	For(i,0,mxs-1){
		if(vis[i])continue;
		for(int u=i;!vis[u];u=nxt[u]) vis[u]=1,++sum;
		swap(nxt[i],nxt[i^(1<<k)]);
//		cout<<"sum "<<sum<<" "<<n-k<<"\n";
		if(sum>=n-k)print();
	}
	return 0;
}