#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int N; cin >> N;
  vector<int> dp(N + 1, 1e9);
  vector<int> ep(N + 1, -1);
  dp[0] = 0;
  for (int i = 1; i * i <= N; i += 2) {
    for (int j = 0; j + i * i <= N; j++) {
      if (dp[j + i * i] > dp[j] + i) {
        dp[j + i * i] = dp[j] + i;
        ep[j + i * i] = i;
      }
    }
  }
  for (int i = 600; i >= 1; i--) {
    for (int j = 0; j + i * i <= N; j++) {
      if (dp[j + i * i] > dp[j] + i) {
        dp[j + i * i] = dp[j] + i;
        ep[j + i * i] = i;
      }
    }
  }
  vector<int> seq;
  int i = N;
  while (i != 0) {
    seq.push_back(ep[i]);
    i -= ep[i] * ep[i];
  }
  vector<int> odd;
  vector<int> even;
  for (int x : seq) {
    if (x % 2 == 0) even.push_back(x);
    else odd.push_back(x);
  }
  sort(odd.begin(), odd.end());
  sort(even.rbegin(), even.rend());
  string ans;
  auto f = [&](int k) {
    char c = ans.empty() ? '0' : ans.back();
    rep(_, k) {
      ans += c;
      c ^= '0' ^ '1';
    };
  };
  for (int k : odd) {
    f(k);
  }
  // 0 n-1
  const int m = even.size();
  for (int i = 0; i < m; i++) {
    if (i % 2 == 0) {
      f(even[i / 2]);
    } else {
      f(even[m - 1 - i / 2]);
    }
  }
  cout << ans << endl;
}