#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;

ll dp[333333],p[333333];

void calc1(ll n) {
  fill(dp,dp+n+1,MAX);
  dp[0]=0;
  rep(i,n+1) {
    for(int j=1; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
    for(int j=2; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
  }
}

void calc2(ll n) {
  fill(dp,dp+n+1,MAX);
  dp[0]=0;
  rep(i,n+1) {
    for(int j=1; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
  }
  rep(i,n+1) {
    for(int j=2; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
  }
}

void calc3(ll n) {
  fill(dp,dp+n+1,MAX);
  dp[0]=0;
  rep(i,n+1) {
    for(int j=2; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
  }
  rep(i,n+1) {
    for(int j=1; i<1000; j+=2) {
      if(j*j+i>n) break;
      if(dp[j*j+i]>dp[i]+j) {
        dp[j*j+i]=dp[i]+j;
        p[j*j+i]=i;
      }
    }
  }
}

string solve(ll n,ll k) {
  if(k==1) calc1(n);
  else if(k==2) calc2(n);
  else  calc3(n);
  vector<ll> v;
  while(n) {
    ll k=n-p[n];
    v.pb(sqrt(k));
    n=p[n];
  }
  sort(all(v));
  string s="";
  rep(i,v.size()) {
    if(v[i]%2==0) continue;
    rep(j,v[i]) s+=(char)(j%2+'0');
  }
  deque<int> deq;
  rep(i,v.size()) {
    if(v[i]%2) continue;
    deq.push_back(v[i]);
  }
  int t=0;
  while(deq.size()) {
    int x;
    if(!t) {
      x=deq.back();
      deq.pop_back();
    } else {
      x=deq.front();
      deq.pop_front();
    }
    rep(j,x) s+=(char)((j+t)%2+'0');
    t^=1;
  }
  return s;
}

bool cmp(string s,string t) {
  if(s.size()!=t.size())return s.size()>t.size();
  rep(i,s.size())if(s[i]!=t[i])return s[i]>t[i];
  return 1;
}


void Main() {
  ll n;
  R n;
  string s=solve(n,1),t=solve(n,2),r=solve(n,3);
  if(cmp(s,t)) s=t;
  if(cmp(s,r)) s=r;
  pr(s);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}