#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
bool to[1000001][2];
char s[1000001];
int n,k,c;
void dfs(int num,int k)
{
    int lim=(1<<k)-1;
    if(!to[num][1])
    {
        to[num][1]=1;
        dfs((num<<1|1)&lim,k);
        s[c--]='1';
    }
    if(!to[num][0])
    {
        to[num][0]=1;
        dfs((num<<1)&lim,k);
        s[c--]='0';
    }
}
inline int run(int p)
{
    c=(2<<p)+p;
    memset(s,'0',sizeof(s));s[c+1]=0;
    memset(to,0,sizeof(to));to[0][0]=1;
    dfs(0,p);
    // printf("%s\n",s+1);

    memset(to,0,sizeof(to));
    int lim=(1<<(p+1))-1,lst=0,now=0;
    for(int i=1;i<=(2<<p)+p;i++)
    {
        now=((now<<1)+s[i]-'0')&lim;
        if(i>k) to[lst][s[i]-'0']=1;
        lst=now;
        // printf("i=%d now=%d\n",i,now);
    }
    // for(int i=0;i<=lim;i++) printf("%d : %d %d\n",i,to[i][0],to[i][1]);
    return lst;
}
void output(int num,int now)
{
    // printf("%d %d\n",num,now);
    if(num==n+1)
    {
        s[n+1]=0;printf("%s\n",s+1);
        exit(0);
    }
    for(int i=1;i>=0;i--) if(!to[now][i])
    {
        to[now][i]=1;s[num]=i+'0';
        output(num+1,(now<<1|i)&((1<<k)-1));
        to[now][i]=0;
    }
}
int main()
{
    n=read();
    if(n==1){ printf("0\n");return 0;}
    while(n>=(1<<(k+1))+k) k++;
    // printf("k=%d\n",k);

    output((1<<k)+k,run(k-1));
    printf("wtf\n");
    return 0;
}