#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */


template<class Type>
Type solve(Type res = Type()){
    ll N; cin >> N;
    vector<ll> dp(N+1,INF);
    dp[0] = 0;
    for(int i = 0; i < N;i++){
        if(dp[i] == INF) continue;
        
        for(ll j = 1; i + j*j <= N; j++){
            dp[i+j*j] = min(dp[i+j*j],dp[i]+j);
        }
    }
    
    vector<ll> vs;
    // cout << dp << endl;
    
    while(N){
        ll nextN = N;
        ll D = -1;
        for(ll j = 1; N-j*j >= 0; j++){
            if(dp[N-j*j]+j == dp[N]){
                nextN = N-j*j;
                D = j;
            }
        }
        
        N = nextN;
        vs.push_back(D);
    }
    sort(vs.begin(),vs.end());
    res = "2";
    
    int n = (int)vs.size();
    vector<int> used(n);
    
    vector<string> s0(n),s1(n);
    for(int i = 0; i < n;i++){
        for(int j = 0; j < vs[i];j++){
            if(j%2 == 0){
                s0[i] += '0';
                s1[i] += '1';
            }else{
                s0[i] += '1';
                s1[i] += '0';
            }
        }
    }
    
    
    function<void(int,string)> rec = [&](int cnt,string t){
        if(cnt == n){
            
            res = min(res,t);
            return;
        }
        if(res < t) return;
        for(int i = 0; i < n;i++){
            if(used[i]) continue;
            
            if(t.empty()){
                used[i] = true;
                rec(cnt+1,t + s0[i]);
                used[i] = false;
                
                
                used[i] = true;
                rec(cnt+1,t + s1[i]);
                used[i] = false;
            }else{
                if(t.back() == '0'){
                    used[i] = true;
                    rec(cnt+1,t + s0[i]);
                    used[i] = false;
                }else{
                    used[i] = true;
                    rec(cnt+1,t + s1[i]);
                    used[i] = false;
                }
            }
        }
    };
    
    rec(0,"");
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    // solve(0);
    cout << fixed << setprecision(15) << solve<string>() << endl;
    return 0;
}