#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    input(n);
    int len = 1;
    while (len * len <= n) {
        len++;
    }
    const int inf = 1 << 29;
    auto dp = make_v(n + 1, inf);
    dp[0] = 0;
    rep(i, 1, len) {
        rep(j, i * i, n + 1) {
            chmin(dp[j], dp[j - i * i] + i);
        }
    }
    dump(dp[n]);
    int sum = n, zero = 0;
    auto display = [&](int l) {
        rep(i, 0, l) {
            cout << char((zero + i) % 2 + '0');
        }
        zero = (zero + l * l + 1) % 2;
    };

    while (sum > 0) {
        vector<int> odd, even;
        rep(i, 1, len) {
            if (sum - i * i >= 0 && dp[sum] == dp[sum - i * i] + i) {
                (i % 2 ? odd : even).push_back(i);
            }
        }
        sort(odd.begin(), odd.end());
        sort(even.rbegin(), even.rend());
        int val = -1;
        if (zero == 0) {
            val = (odd.size() > 0 ? odd[0] : even[0]);
        } else {
            val = even.back();
        }
        sum -= val * val;
        display(val);
    }
    cout << endl;

    return 0;
}