#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt,__func__,__LINE__,##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=2e5+5;
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
int n,k,S,h[N];
int stk[N],tp,pos[N];
int nxt[N];
void dfs1(int u){
  for(int i=h[u];i<2;i=h[u]){
    h[u]++;
    dfs1((u<<1|i)&S);
    stk[++tp]=u<<1|i;
  }
}
bool vis[N];
void print(int i){
  int now=i;
  while(vis[now]) vis[now]=0,putchar(nxt[now]+'0'),now=(now<<1|nxt[now])&S;
}
signed LJY(){
  n=read();
  if(n<=1) puts("0"),exit(0);
  else if(n<=2) puts("01"),exit(0);
  k=0;while(n>=(1<<k)+k-1) k++;k--;
  S=(1<<k-1)-1;
  dfs1(0);
  reverse(stk+1,stk+(1<<k)+1);
  For(i,1,(1<<k)){
    int pre=(i==1?(1<<k):i-1);
    nxt[stk[pre]]=!(stk[i]&1);
    pos[stk[i]]=i;
  }int len=(1<<k)+k-1,fir=0;S=(1<<k)-1;
  // Debug("%d\n",len);
  For(i,0,S) if(!vis[i]&&len<=n){
    int siz=0;int now=i;
    while(!vis[now]) vis[now]=1,++siz,now=(now<<1|nxt[now])&S;
    if(len+siz<n){len+=siz;continue;}
    while(vis[now]) vis[now]=0,++siz,now=(now<<1|nxt[now])&S;
    now=i;
    ForDown(j,k-1,0) putchar((i>>j&1)+'0');
    For(i,1,n-len) putchar(nxt[now]+'0'),now=(now<<1|nxt[now])&S;
    now=pos[now]+1;if(now>(1<<k)) now=1;
    For(i,1,(1<<k)-1){
      putchar((stk[now]&1)+'0');
      if(vis[stk[now]]) print(stk[now]);
      now++;if(now>(1<<k)) now=1;
    }return 0;
  }
  return 0;
}