#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

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

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
void solve(int len, char c, string &ans) {
  while (len--) {
    ans += c;
    if (c == '0') {
      c = '1';
    } else {
      c = '0';
    }
  }
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n; cin >> n;
  vector<int> dp(n + 1, INF), prev0(n + 1, -1), prev1(n + 1, -1);
  dp[0] = 0;
  FOR(i, 1, n + 1) {
    for (int j = 1; j * j <= i; ++j) {
      int score = dp[i - j * j] + j;
      if (score < dp[i]) {
        dp[i] = score;
        prev0[i] = prev1[i] = j;
      } else if (score == dp[i]) {
        if (prev0[i] % 2 == 0) prev0[i] = j;
        if (prev1[i] % 2 == 1) prev1[i] = j;
      }
    }
  }
  string ans = "0";
  int now = n;
  while (now > 0) {
    if (ans.back() == '0') {
      solve(prev0[now], '0', ans);
      now -= prev0[now] * prev0[now];
    } else {
      solve(prev1[now], '1', ans);
      now -= prev1[now] * prev1[now];
    }
  }
  ans.erase(ans.begin());
  cout << ans << '\n';
  return 0;
}