//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
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 T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const size_t N = 3e5+10;

//head

int n;
int dp[N];
vi G[N];
bitset<N> bits;
string ans;

bool comp(int i, int j) {
  return (i^j)&1 ? (i&1)==1 : i&1 ? i<j : i>j;
}

int dfs1(int x) {
  if(x == 0) {
    return 0;
  }
  if(dp[x]) return dp[x];
  int &res = dp[x] = INF;
  rep(i, int(sqrt(x)+0.001)) {
    int k = i+1;
    chmin(res, dfs1(x-k*k) + k);
  }
  return res;
}
void dfs2(int x) {
  if(!x) return;
  if(bits.test(x)) return;
  rep(i, int(sqrt(x)+0.001)) {
    int k = i+1;
    if(dp[x] == dp[x-k*k] + k) {
      G[x-k*k].emplace_back(k);
      dfs2(x-k*k);
    }
  }
  bits.set(x);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  dfs1(n);
  dfs2(n);
  //rep(i, n+1) cout << dp[i] << endl;
  /*
  rep(i, n+1) {
    cout << G[i].size() << endl;
    rep(j, G[i].size()) {
      cout << G[i][j] << (j == G[i].size()-1?'\n':' ');
    }
  }
  */
  int now = 0;
  while(now != n) {
    sort(all(G[now]), comp);
    if(ans.empty() or ans[ans.size()-1] == '0') {
      rep(i, G[now][0]) {
        ans += char('0'+(i&1));
      }
      now += G[now][0]*G[now][0];
    }
    else {
      rep(i, G[now][G[now].size()-1]) {
        ans += char('1'-(i&1));
      }
      now += G[now][G[now].size()-1]*G[now][G[now].size()-1];
    }
  }

  cout << ans << endl;
}