#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin>>N;
    vector dp(N+1,vector<int>(2,1<<30));
    vector to(N+1,vector<int>(2,-1));
    dp[0][0]=0;
    for(int x=0;x<N;x++){
        for(int t=0;t<2;t++){
            if(t==0){
                for(int a=1;x+a*a<=N;a+=2){
                    if(chmin(dp[x+a*a][t],dp[x][t]+a)){
                        to[x+a*a][t]=a;
                    }
                }
                for(int a=2;x+a*a<=N;a+=2){
                    if(chmin(dp[x+a*a][1-t],dp[x][t]+a)){
                        to[x+a*a][1-t]=a;
                    }
                }
            }else{
                for(int a=2;x+a*a<=N;a+=2){
                    if(chmin(dp[x+a*a][1-t],dp[x][t]+a)){
                        to[x+a*a][1-t]=a;
                    }
                }
                for(int a=1;x+a*a<=N;a+=2){
                    if(chmin(dp[x+a*a][t],dp[x][t]+a)){
                        to[x+a*a][t]=a;
                    }
                }
            }
        }
    }
    int x=N,t=0;
    if(dp[N][0]>dp[N][1])t=1;
    else t=0;
    string S="";
    while(to[x][t]!=-1){
        int a=to[x][t];
        x-=a*a;
        if(a%2==0)t=1-t;
        for(int i=a-1;i>=0;i--){
            if(i%2==t)S+='0';
            else S+='1';
        }
    }
    reverse(all(S));
    cout<<S<<"\n";
}