#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef double db;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define fir first
#define sec second
typedef vector <int> vi;
typedef vector <ll> vl;

#ifdef LCX
#define msg(args...) fprintf(stderr, args)
#else
#define msg(...) void()
#endif

const int maxn = 2e5 + 10;
int n, k;

vi vec;
int vis[maxn][2];
void dfs(int u) {
    for (int c = 0; c < 2; ++c)
        if (!vis[u][c]) {
            vis[u][c] = 1;
            int e = (u << 1 | c);
            dfs(e & ((1 << (k - 1)) - 1));
            vec.push_back(e);
        }
}

vi circ[maxn];
void go(int u) {
    vi &path = circ[u];
    while (1) {
        int flg = 1;
        for (int c = 0; c < 2 && flg; ++c)
            if (!vis[u][c]) {
                vis[u][c] = 1;
                u = (u << 1 | c) & ((1 << k) - 1);
                path.push_back(u);
                flg = 0;
            }
        if (flg) break;
    }
}

char s[maxn];

int main() {
    scanf("%d", &n);
    if (n <= 10) {
        int mx = 0;
        for (int S = 0; S < (1 << n); ++S) {
            int res = 0;
            for (int i = 1; i <= n; ++i) {
                set <int> st;
                for (int l = 0; l + i <= n; ++l)
                    st.insert((S >> l) & ((1 << i) - 1));
                res += st.size();
            }
            if (res > mx) {
                mx = res;
                for (int i = 1; i <= n; ++i)
                    s[i] = ((S >> (i - 1)) & 1) + '0';
            }
        }
        printf("%s\n", s + 1);
        return 0;
    }
    while ((1 << k) + k - 1 <= n) ++k;
    --k;
    dfs(0);
    reverse(begin(vec), end(vec));
    memset(vis, 0, sizeof vis);
    int len = vec.size(), rst = n - (1 << k) - k + 1;
    // for (int i = 0; i < len; ++i) msg("%d%c", vec[i], " \n"[i == len - 1]);
    for (int i = 0; i < len; ++i)
        vis[vec[i]][vec[(i + 1) % len] & 1] = 1;
    vi ans;
    for (int i = 0; i < len; ++i) {
        go(vec[i]);
        // msg("@%d\n", rst);
        if (rst < (int) circ[vec[i]].size()) {
            for (int j = i + 1; j < len; ++j) ans.push_back(vec[j]);
            for (int j = 0; j < i; ++j) {
                ans.push_back(vec[j]);
                for (int u : circ[vec[j]])
                    ans.push_back(u);
            }
            ans.push_back(vec[i]);
            for (int u : circ[vec[i]]) {
                if (!rst) break;
                --rst, ans.push_back(u);
            }
            break;
        }
        else rst -= circ[vec[i]].size();
    }
    // msg("ans");
    // for (int u : ans) msg(" %d", u);
    // msg("\n");
    n = 0;
    for (int i = k - 1; i > 0; --i)
        s[++n] = '0' + ((ans[0] >> i) & 1);
    for (int u : ans) s[++n] = '0' + (u & 1);
    printf("%s\n", s + 1);
    return 0;
}