#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

const int N=4000010;

int n,ans[N],anslen,k;

vector<int> ham;
vector<array<int,2> > G[N];
void dfs(int u)
{
	if (!G[u].size()) return;
	auto t=G[u].back(); G[u].pop_back();
	ham.push_back(2*u+t[1]);
	dfs(t[0]);
}
void getham()
{
	rep(i,0,(1<<(k-1))-1) rep(j,0,1)
	{
		G[i].push_back({(2*i+j)%(1<<(k-1)),j});
//		printf("i %d -> %d %d\n",i,((2*i+j)%(1<<(k-1))),j);
	}
	dfs(0);
	assert(ham.size()==(1<<k));
	int p0=-1;
	rep(i,0,(1<<k)-1) if (ham[i]==0) p0=i;
	assert(p0>=0);
	rotate(ham.begin(),ham.begin()+p0,ham.end());
//	printf("ham : ");
//	rep(i,0,(1<<k)-1) printf("%d ",ham[i]);
//	printf("\n");
}

void solve()
{
	while ((1<<k)+k-1<=n) k++;
	k--;
//	printf("n %d k %d len %d\n",n,k,(1<<k)+k-1);
	
	getham();
	if (n==(1<<k)+(k-1))
	{
		drep(i,k,1) ans[++anslen]=((ham[0]>>i)&1);
		rep(i,1,(1<<k)-1) ans[++anslen]=(ham[i]&1);
		return;
	}
	vector<int> seq(1<<k);
	rep(i,0,(1<<k)-1) seq[i]=(2*ham[i]+(ham[(i+1)%(1<<k)]&1));
//	rep(i,0,(1<<k)-1) printf("seq %d = %d\n",i,seq[i]);
	
	vector<int> nxt(1<<(k+1),-1),vis(1<<(k+1));
	rep(i,0,(1<<k)-1) nxt[seq[i]]=seq[(i+1)%(1<<k)];
	rep(i,0,(1<<(k+1))-1) if (nxt[i]==-1) nxt[i]=nxt[i^(1<<k)]^1;
	rep(i,0,(1<<k)-1) vis[seq[i]]=1;
	
	int now=(1<<k);
	rep(i,0,(1<<(k+1))-1) if (!vis[i])
	{
		int cnt=0,x=i;
		while (!vis[x]) vis[x]=1,x=nxt[x],cnt++;
		swap(nxt[i],nxt[i^(1<<k)]);
		now+=cnt;
		
		if (now+k>=n)
		{
			int st=nxt[i];
			drep(j,k,1) ans[++anslen]=((st>>j)&1);
			rep(j,1,n-k)
			{
				ans[++anslen]=(st&1);
				st=nxt[st];
			}
			return;
		}
	}
}

namespace checker
{
	struct info
	{
		int ch[2],len,fa;
	}t[N];
	int cnt=1,lst=1;
	void insert(int c)
	{
		int node=++cnt,p=lst; 
		t[node].len=t[p].len+1; lst=node;
		for (;p&&!t[p].ch[c];p=t[p].fa) t[p].ch[c]=node;
		if (!p) t[node].fa=1;
		else
		{
			int q=t[p].ch[c];
			if (t[p].len+1==t[q].len) t[node].fa=q;
			else
			{
				int clone=++cnt;
				t[clone]=t[q];
				t[clone].len=t[p].len+1;
				t[q].fa=t[node].fa=clone;
				for (;p&&t[p].ch[c]==q;p=t[p].fa) t[p].ch[c]=clone;
			}
		}
	}
	
	void solve()
	{
		ll v1=0;
		rep(i,1,30) v1+=max(0,min((1<<i),n-i+1));
		rep(i,31,n) v1+=n-i+1;
		rep(i,1,n) insert(ans[i]);
		
		ll v2=0;
		rep(i,1,cnt) v2+=t[i].len-t[t[i].fa].len;
		printf("v1 %lld v2 %lld\n",v1,v2);
		assert(v1==v2);
		printf("ok\n");
	}
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	
	cin>>n;
	if (n==1)
	{
		printf("1\n");
		return 0;
	}
	if (n==2)
	{
		printf("10\n");
		return 0;
	}
	if (n==3)
	{
		printf("101\n");
		return 0;
	}
	
	solve();
	assert(anslen==n); 
	rep(i,1,anslen) printf("%d",ans[i]);
	printf("\n");
	
	#ifdef pbtxdy
	checker::solve();
	#endif
	
	return 0;
}