#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

bool b(ll x,ll y) { return x%2>y%2||(x%2&&y%2&&x>y)||(!x%2&&!y%2&&x<y); }

vector<ll> len, pre;
void dfs(ll n) {
  if (len[n]!=INF) return;
  for (ll i=1; i*i<=n; i+=2) {
    dfs(n-i*i);
    if (len[n]>len[n-i*i]+i) {
      len[n]=len[n-i*i]+i;
      pre[n] = i;
    }
  }
  for (ll i=2; i*i<=n; i+=2) {
    dfs(n-i*i);
    if (len[n]>len[n-i*i]+i) {
      len[n]=len[n-i*i]+i;
      pre[n] = i;
    }
  }

}

int main() {
  ll N; cin >> N;
  len.resize(N+1,INF); len[0] = 0;
  pre.resize(N+1,INF); pre[0] = -1;
  dfs(N);

  ll tn = N;
  vector<ll> r;
  while (tn) { r.push_back(pre[tn]); tn -= pre[tn]*pre[tn]; }
  // sort(all(r),[](const ll &x, const ll &y){return b(x,y);});
  vector<ll> o, e; for(auto x: r) { if (x%2) o.push_back(x); else e.push_back(x); }
  sort(all(o)); sort(all(e));
  // debug(all(r)); debug(all(o)); debug(all(e));

  string result;
  for (auto x: o) {
    rep(i,x/2) result += "01";
    result += "0";
  }
  rep(i,e.size()) {
    ll np = i%2==0 ? (e.size()-1)-i/2 : i/2;
    if (i%2==0) rep(j,e[np]/2) result += "01";
    else rep(j,e[np]/2) result += "10";
  }
  cout << result << endl;
  return 0;
}