#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n;
    cin >> n;

    vector<int> dp(n + 1);
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        int t = i;
        for (int j = 1; j * j <= i; j++) {
            t = min(t, dp[i - j * j] + j);
        }
        dp[i] = t;
    }

    int l = dp[n];
    string s(l, '0');
    int i0 = 0, u = n;

    for (int i = 1; i < l; i++) {
        int j = i - i0;
        int t = u - j * j;
        if (s[i - 1] == '0') {
            if (dp[u] == dp[t] + j) {
                u = t;
                i0 = i;
                s[i] = '0';
            } else {
                s[i] = '1';
            }
        } else {
            int f = 0;
            for (j++; j * j <= u; j++) {
                if (dp[u] == dp[u - j * j] + j) {
                    f = 1;
                    break;
                }
            }
            if (f == 0) {
                u = t;
                i0 = i;
                s[i] = '1';
            } else {
                s[i] = '0';
            }
        }
    }
    cout << s << endl;

    return 0;
}