#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define db double
#define fi first
#define se second
#define vi vector<int>
#define inf 0x3f3f3f3f
using namespace std;
const int N=4e5+5;
int n,K,p[N],lim,sz,rest,cnt,s,to[N];
bool vs[N],vs0[N],vs1[N],vs2[N];
bool dfs(int u){
    vs[u]=1,p[sz++]=u;
    if(sz==(1<<K)&&u==(1<<K-1))return 1;
    if(!vs[(u<<1)&lim]&&dfs((u<<1)&lim))return 1;
    if(!vs[(u<<1|1)&lim]&&dfs((u<<1|1)&lim))return 1;
    sz--,vs[u]=0;return 0;
}
int id(int x,int y){
    if(x>>K-1&1)return y|(1<<K);
    return y;
}
void dfs0(int u,int topf){
    int v=(u<<1)&lim;
    if(!vs0[id(u,v)]&&id(u,v)!=topf)cnt++,dfs0(v,id(u,v));
}
void dfs1(int u,int topf){
    cout<<(u>>K-1&1);
}
vector<int>res;
void opt(){
    int sz=res.size();
    for(int i=0;i<sz-1;i++){
        cout<<(res[i]>>K-1&1);
    }
    for(int i=K-1;i>=0;i--){
        cout<<(res[sz-1]>>i&1);
    }
    exit(0);
}
signed main(){
    // freopen("data.in","r",stdin);
    // freopen("own.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n;while((1<<K+1)<=n-K)K++;
    lim=(1<<K)-1;
    dfs(0);
    for(int i=0;i<1<<K;i++){
        int x=p[i],y=p[i+1&lim];
        vs0[id(x,y)]=1;
    }
    rest=n-K-(1<<K);
    //cout<<rest<<"\n";
    if(rest<0){
        for(int i=0;i<sz;i++)res.pb(p[i]);
        opt();
    }
    for(int i=0;i<1<<K;i++){
        int j=(i<<1)&lim;
        if(!vs0[id(i,j)])to[i]=j;
        else to[i]=(i<<1|1)&lim;
    }
    for(int i=0;i<1<<K;i++){
        if(!vs1[i]){
            cnt=0;
            int u=i;
            do{
                vs1[u]=1,cnt++,u=to[u];
            }while(u!=i);
            if(rest>=cnt){
                rest-=cnt,vs2[i]=1;
            }
            else if(rest>0){
                s=i;
                break;
            }
        }
    }
    // for(int i=0;i<1<<K;i++){
    //     cout<<p[i]<<"\n";
    // }
    int x=0;while(p[x]!=s)x++;
    int y=x;
    do{
        int i=p[y],u=i;
        if(vs2[i]){
            do{
                res.pb(u);
                u=to[u];
            }while(u!=i);
        }
        res.pb(i);
        y=(y+1)&lim;
    }while(y!=x);
    int u=p[y];
    for(int i=1;i<=rest+1;i++){
        res.pb(u);
        u=to[u];
    }
    opt();
}