#include <bits/stdc++.h>
#define sz(a) ((int)(a).size())
using namespace std;
const int N = 2e5 + 5;
int n, k, e[N][2], a[N], an, b[N], bn;
vector<int> f[N];
void init(int k) 
{
    for(int i = 0; i < (1 << k); i++) 
    {
        e[i][0] = (i << 1) & ((1 << k) - 1);
        e[i][1] = (i << 1 | 1) & ((1 << k) - 1);
    }
}
void work(int k) 
{
    if(k == 0) {a[++an] = 0, a[++an] = 0, a[++an] = 1; return;}
    init(k);
    auto dfs = [&](auto self, int u) -> void
    {
        while(e[u][0] != -1) 
        {
            int v = e[u][0];
            e[u][0] = -1; swap(e[u][0], e[u][1]); self(self, v); 
        }
        a[++an] = u;
    };  
    dfs(dfs, 0); reverse(a + 1, a + an + 1);
}
int main()
{
    scanf("%d", &n); 
    if(n == 1) return printf("0\n"), 0;
    if(n == 2) return printf("01\n"), 0;
    while((1 << (k + 1)) + k <= n) k++;
    work(k - 1), n -= (1 << k) + k - 1; 
    if(n == 0) 
    {
        for(int i = 1; i <= k - 1; i++) printf("0");
        for(int i = 2; i <= an; i++) printf("%d", a[i] & 1);
        printf("\n"); return 0;
    }
    init(k); n--; 
    for(int i = 1; i <= an; i++) a[i] = (i < an ? (a[i] << 1 | (a[i + 1] & 1)) : a[1]); 
    for(int i = 1; i < an; i++)
    {
        e[a[i]][a[i + 1] & 1] = -1;
        if(e[a[i]][0] == -1) swap(e[a[i]][0], e[a[i]][1]);
    }
    for(int i = 1; i < an; i++) 
    {
        int u = a[i];
        if(e[u][0] != -1) 
        {
            int z = e[u][0];
            while(e[z][0] != -1) 
            {
                int v = e[z][0]; e[z][0] = -1;
                f[i].push_back(z), z = v;
            }
        }
        if(n > sz(f[i])) n -= sz(f[i]);
        else 
        {
            f[i].resize(n); 
            for(int j = k - 1; j >= 0; j--) printf("%d", (a[i] >> j) & 1);
            for(int j = i + 1; j < an; j++) printf("%d", a[j] & 1);
            for(int j = 1; j <= i; j++) 
            {
                printf("%d", a[j] & 1);
                for(auto u: f[j]) printf("%d", u & 1);
            }
            break;
        }
    }
    return 0;
}