#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P, P> PP;
constexpr ll MOD = ll(1e9 + 7);
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e5) + 5;
constexpr double EPS = 1e-9;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define ALL(v) (v).begin(), (v).end()


int main() {
    ll n;
    cin >> n;
    vector<ll> dp(n+1, IINF), pre(n+1);
    dp[0] = 0;
    for(int i=0;i<n;i++){
        for(int j=1;i+j*j<=n;j++){
            if(dp[i+j*j] > dp[i] + j){
                dp[i+j*j] = dp[i]+j;
                pre[i+j*j] = j;
            }
        }
    }
    vector<ll> len, ev, od;
    for(int i=n; i>0; i-=pre[i]*pre[i]){
        if(pre[i]%2){
            od.push_back(pre[i]);
        }
        else{
            ev.push_back(pre[i]);
        }
    }
    sort(od.begin(), od.end());
    sort(ev.rbegin(), ev.rend());
    for(auto l : od) len.push_back(l);
    for(auto l : ev) len.push_back(l);
    string ans = "";
    int b = 0;
    for(auto l : len){
        for(int i=0;i<l;i++){
            ans.push_back(char('0'+(i+b)%2));
        }
        b ^= (l&1)^1;
    }
    cout << ans << endl;
    return 0;
}