#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

const int INF = 1<<20;
int dp[300000+1];
int pr[300000+1];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  fill(dp, dp+n+1, INF);
  
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j * j <= i; j++) {
      if (dp[i - j * j] + j < dp[i]) {
        dp[i] = dp[i - j * j] + j;
        pr[i] = j;
      }
    }
  }

  vector<int> ls;
  while (n > 0) {
    ls.push_back(pr[n]);
    n -= pr[n] * pr[n];
  }

  sort(ls.begin(), ls.end());
  
  string s = "0";
  REP (i, ls.size()) {
    if (ls[i] % 2) {
      s += s.back();
      REP (j, ls[i]-1)
        s += '0' + '1' - s.back();
    }
  }

  for (int i = ls.size() - 1; i >= 0; i--) {
    if (ls[i] % 2 == 0) {
      s += s.back();
      REP (j, ls[i]-1)
        s += '0' + '1' - s.back();
    }
  }
  
  cout << s.substr(1) << endl;
  
  return 0;
}