#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  auto dp = make_v< int >(N + 1);
  auto pre = make_v< int >(N + 1);
  fill_v(pre, -1);
  fill_v(dp, inf);
  dp[0] = 0;
  for(int i = 0; i <= N; i++) {
    for(int p = 1; i + p * p <= N; p++) {
      chmin(dp[i + p * p], dp[i] + p);
    }
  }
  string s = "0";
  while(N > 0) {
    bool ok = false;
    if(s.back() == '0') { // 0で終わる最も短いもの
      for(int p = 1; N - p * p >= 0; p += 2) {
        if(dp[N - p * p] + p == dp[N]) {
          for(int q = 0; q < p; q++) s += "01"[q & 1];
          N -= p * p;
          ok = true;
          break;
        }
      }
      if(ok) continue;
      int p = 0;
      while(N - (p + 2) * (p + 2) >= 0) p += 2;
      for(; p > 0; p -= 2) {
        if(dp[N - p * p] + p == dp[N]) {
          for(int q = 0; q < p; q++) s += "01"[q & 1];
          N -= p * p;
          break;
        }
      }
    } else {
      for(int p = 2; N - p * p >= 0; p += 2) {
        if(dp[N - p * p] + p == dp[N]) {
          for(int q = 0; q < p; q++) s += "10"[q & 1];
          N -= p * p;
          ok = true;
          break;
        }
      }
      if(ok) continue;

      int p = 1;
      while(N - (p + 2) * (p + 2) >= 0) p += 2;
      for(; p > 0; p -= 2) {
        if(dp[N - p * p] + p == dp[N]) {
          for(int q = 0; q < p; q++) s += "10"[q & 1];
          N -= p * p;
          break;
        }
      }

    }
  }
  cout << s.substr(1) << endl;
}