#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }


template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
    os << "{";
    for (int i = 0; i < v.size(); ++i) {
        if(i) os << ", ";
        os << v[i];
    }
    return os << "}";
}

template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
    return os << "{" << p.first << ", " << p.second << "}";
}


int main() {
    int n;
    cin >> n;
    auto dp = make_v(n+1, INF<int>);
    dp[0] = 0;
    vector<int> sq(n+1);
    sq[0] = 0;
    for (int i = 1; i <= n; ++i) {
        sq[i] = sq[i-1];
        while((sq[i]+1)*(sq[i]+1) <= i) sq[i]++;
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = sq[i]; j >= 1; --j) {
            chmin(dp[i], dp[i-j*j]+j);
        }
    }

    int cur = n;
    vector<int> v;
    while(cur){
        for (int i = sq[cur]; i >= 1; --i) {
            if(dp[cur-i*i] == dp[cur]-i) {
                v.emplace_back(i);
                cur -= i*i;
                break;
            }
        }
    }
    auto f = [&](vector<int> &x){
        string s;
        int cur = 0;
        for (auto &&i : x) {
            for (int j = 0; j < i; ++j) {
                s += char('0'+cur);
                cur ^= 1;
            }
            cur ^= 1;
        }
        return s;
    };
    sort(v.begin(),v.end());
    string ans = f(v);
    do {
        ans = min(ans, f(v));
    }while(next_permutation(v.begin(),v.end()));
    cout << ans << "\n";
    return 0;
}