#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

const int MA = (int)3e+5;

int f(int x) {
    if (x & 1)return x;
    else return MA * 2 - x;
}

void solve() {
    int N;
    cin >> N;
    vi dp(N + 1, MA), ma(N + 1), mi(N + 1);
    dp[0] = 0;
    rep(i, N) {
        for (int j = 1; i + j * j <= N; ++j) {
            if (dp[i + j * j] > dp[i] + j) {
                dp[i + j * j] = dp[i] + j;
                ma[i + j * j] = j;
                mi[i + j * j] = j;
            } else if (dp[i + j * j] == dp[i] + j) {
                if (f(ma[i + j * j]) < f(j)) {
                    ma[i + j * j] = j;
                }
                if (f(mi[i + j * j]) > f(j)) {
                    mi[i + j * j] = j;
                }
            }
        }
    }

    int mod = 0, n = N;
    while (n > 0) {
        int x = mod ? ma[n] : mi[n];
        rep(i, x) {
            cout << (mod + i) % 2;
        }
        n -= x * x;
        mod ^= (x & 1) ^ 1;
    }
    cout << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}