#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
 
int main(){
    int n;cin >> n;
    vector<int> dp(n + 1, INF);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 1; j * j <= n; j++) {
            if(i + j * j <= n) chmin(dp[i + j * j], dp[i] + j);
        }
    }
    vector<int> odd,even;
    for (int i = n; i > 0;) {
        for (int j = 1; j * j <= n; j+=2) {
            while(i - j * j >= 0 && dp[i] == dp[i - j * j] + j){
                if(j % 2) odd.pb(j);
                else even.pb(j);
                i -= j * j;
            }
        }
        for (int j = 2000; j >= 2; j-=2) {
            while(i - j * j >= 0 && dp[i] == dp[i - j * j] + j){
                if(j % 2) odd.pb(j);
                else even.pb(j);
                i -= j * j;
            }
        }
    }
    sort(ALL(odd));
    sort(ALL(even));
    string ans = "";
    for(auto a: odd){
        for (int i = 0; i < a; i++) {
            if(i == 0){
                if(ans.length()){
                    if(ans.back() == '0') ans += '0';
                    else ans += '1';
                }
                else{
                    ans += '0';
                }
            }
            else{
                if(ans.back() == '0') ans += '1';
                else ans += '0';
            }
        }
    }
    deque<int> dq;
    for (int i = 0; i < even.size(); i++) {
        dq.pb(even[i]);
    }
    for (int k = 0; k < even.size(); k++) {
        int a = 0;
        if(k % 2 == 0){
            a = dq.back();
            dq.pop_back();
        }
        else{
            a = dq.front();
            dq.pop_front();
        }
        for (int i = 0; i < a; i++) {
            if(i == 0){
                if(ans.length()){
                    if(ans.back() == '0') ans += '0';
                    else ans += '1';
                }
                else{
                    ans += '0';
                }
            }
            else{
                if(ans.back() == '0') ans += '1';
                else ans += '0';
            }
        }
    }
    cout << ans << endl;
    return 0;
}