#include<bits/stdc++.h>
using namespace std;

#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define lfs <<fixed<<setprecision(10)<<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
template<typename T>
void emp(map<T,ll>&m, T x){m.emplace(x,0).first->second++;}

int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<P>dp(n+1,MP(INF,-1));
  dp[0]=MP(0,0);
  rep(i,0,n){
    for(ll j=1;i+j*j<=n;j++){
      if(dp[i+j*j].fi>=dp[i].fi+j){
        if(dp[i+j*j].fi==dp[i].fi+j){
          ll x=dp[i+j*j].se;
          if(j%2==1){
            if(j<x||x%2==0)dp[i+j*j].se=j;
          }
        }
        else{
          dp[i+j*j].fi=dp[i].fi+j;
          dp[i+j*j].se=j;
        }
      }
    }
  }
  //rep(i,0,10)cout<<dp[i].fi<<endl;
  vector<ll>even,odd;
  buf=n;
  while(buf!=0){
    ll x=dp[buf].se;
    if(x%2==0)even.push_back(x);
    else odd.push_back(x);
    buf-=x*x;
  }
  sort(ALL(odd));
  sort(ALL(even));
  string s;
  //debug(odd,odd.size());
  //debug(even,even.size());
  rep(i,0,odd.size()){
    ll x=odd[i];
    rep(j,0,x){
      if(j%2==0)s+='0';
      else s+='1';
    }
  }
  ll l=0,r=(ll)even.size()-1;
  while(1){
    if(r<l)break;
    ll x=even[r];
    rep(i,0,x){
      if(i%2==0)s+='0';
      else s+='1';
    }
    r--;
    if(r<l)break;
    x=even[l];
    rep(i,0,x){
      if(i%2==1)s+='0';
      else s+='1';
    }
    l++;
  }
  cout<<s<<endl;
  return 0;
}