#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;

int N;
ll dp[303030];
ll par[303030];
ll par2[303030];

void solve() {
    cin >> N;
    REP(i, N+1) dp[i] = 1LL << 59;

    dp[0] = 0;

    REP(i, N) for (ll j = 1; i + j * j <= N; ++j) {
        if (dp[i] + j <= dp[i + j * j]) {
            dp[i + j * j] = dp[i] + j;
            par[i + j * j] = i;
            par2[i + j * j] = j;
        }
    }

    vector<int> odd;
    vector<int> even;

    for (ll i = N; i > 0; ) {
        if (par2[i] % 2 == 0) {
            even.push_back(par2[i]);
        } else {
            odd.push_back(par2[i]);
        }
        i = par[i];
    }

    sort(odd.begin(), odd.end());
        sort(even.begin(), even.end());

    int v = 0;
    for (auto x: odd) {
        REP(_, x) {
            cout << v;
            v ^= 1;
        }
        v ^= 1;
    }
    for (auto x: even) {
        REP(_, x) {
            cout << v;
            v ^= 1;
        }
        v ^= 1;
    }

    cout << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}