#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
typedef long long LL;
int n, k, to[1000010], repr[1000010], bel[1000010], siz[1000010];
vector<int> g[1000010];
vector<int> ans;
void dfs(int u) {
  while (!g[u].empty()) {
    int v = g[u].back();
    g[u].pop_back();
    dfs(v);
    ans.push_back(v & 1);
  }
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n;
  if (n == 1) return cout << "1" << endl, 0;
  if (n == 2) return cout << "10" << endl, 0;
  while (k + (1 << (k + 1)) <= n) ++k;
  int pk1 = 1 << (k - 1), pk2 = pk1 << 2, pk = pk2 >> 1;
  for (int i = 0; i < pk1; i++) {
    g[i] = {(i << 1 | 1) % pk1, (i << 1) % pk1};
  }
  dfs(0);
  reverse(ans.begin(), ans.end());
  ans.insert(ans.begin(), k - 1, 0);
  for (int x : ans) cerr << x;
  cerr << endl;
  memset(to, -1, sizeof to);
  int lst = 0;
  for (int i = 0, now = 0; i < ans.size(); i++) {
    now = (now << 1 | ans[i]) % pk2;
    if (i >= k) to[lst] = now;
    lst = now;
  }
  to[lst] = (lst << 1) % pk2;
  for (int i = 0; i < pk; i++) {
    if (~to[i] && to[i + pk] == -1) to[i + pk] = to[i] ^ 1;
    if (~to[i + pk] && to[i] == -1) to[i] = to[i + pk] ^ 1;
  }
  memset(repr, -1, sizeof repr);
  memset(bel, -1, sizeof bel);
  for (int i = 0; i < pk2; i++) {
    if (~repr[i]) continue;
    bel[i] = i;
    for (int j = i; repr[j] == -1; j = to[j]) repr[j] = i, siz[i] += 1;
  }
  for (int i = 0; i < pk; i++) {
    if (bel[repr[i]] != bel[repr[i + pk]]) {
      int u = repr[i], v = repr[i + pk], flag = false;
      if (bel[v] == 0) swap(u, v), flag = true;
      if (bel[u] == 0 && siz[u] >= n - k + 1) continue;
      bel[v] = u;
      siz[u] += siz[v];
      swap(to[i], to[i + pk]);
      if (bel[u] == 0 && siz[u] >= n - k + 1) {
        ans.clear();
        for (int j = k - 2; j >= 0; j--) ans.push_back((i + pk * !flag) >> j & 1);
        for (int now = to[i + pk * !flag]; ans.size() < n; now = to[now]) ans.push_back(now & 1);
        for (int x : ans) cout << x;
        cout << endl;
        return 0;
      }
    }
  }
  ans.assign(k - 1, 0);
  for (int now = 0; ans.size() < n; now = to[now]) ans.push_back(now & 1);
  for (int x : ans) cout << x;
  cout << endl;
  return 0;
}