#include <bits/stdc++.h>
#define ALL(x) begin(x), end(x)
using namespace std;
void file() {
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
}
using ll = long long;

const int kN = 2e5 + 5;
int n;
array<vector<pair<int, int>>, kN> g;

void add(int u, int v, int w) {
  g[u].emplace_back(v, w);
}
vector<pair<int, int>> path;
void dfs(int x) {
  for(int to, w; !g[x].empty(); ) {
    tie(to, w) = g[x].back(), g[x].pop_back();
    dfs(to), path.emplace_back(to, w);
  }
}

array<int, kN> nxt, jp;
array<bool, kN> vis;
array<vector<int>, kN> circ;

int main() {
  // file();
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n;
  if(n == 1) return cout << "0\n", 0;
  if(n == 2) return cout << "01\n", 0;
  int k = 1;
  for(; (1 << k) <= n - k + 1; k++) ; k--;
  for(int i = 0; i < (1 << k); i++) {
    add(i & ((1 << k - 1) - 1), i / 2, i);
  }
  dfs(0);
  int len = (1 << k);
  for(int i = 0; i < len; i++) {
    nxt[path[i].second] = path[(i + 1) % len].second;
  }
  int need = n - k - (1 << k) + 1;
  for(int i = 0; i < (1 << k + 1); i++) {
    int u = i / 2, v = i & ((1 << k) - 1);
    if(nxt[u] != v) jp[u] = v;
  }
  for(int i = 0; i < (1 << k); i++) {
    if(vis[i] == 1) continue;
    vector<int> buc;
    for(int j = i; vis[j] == 0; vis[j] = 1, j = jp[j]) {
      buc.push_back(j);
    }
    if(buc.size() > need) {
      string ans;
      for(int j = k - 1; j >= 1; j--) {
        ans += char(((i >> j) & 1) + '0');
      }
      for(int j = i, f = 0; f == 0; f |= ((j = nxt[j]) == i)) {
        ans += char((j & 1) + '0');
        for(int k : circ[j]) ans += char((k & 1) + '0');
      }
      for(int j = 0; j < need; j++) {
        ans += char((buc[j] & 1) + '0');
      }
      cout << ans << "\n";
      exit(0);
    }else {
      rotate(begin(buc), begin(buc) + 1, end(buc));
      circ[i] = buc, need -= buc.size();
    }
  }
  string ans;
  for(int i = 1; i < k; i++) ans += "0";
  for(int i = 0, f = 0; f == 0; f |= ((i = nxt[i]) == 0)) {
    ans += char((i & 1) + '0');
    for(int j : circ[i]) ans += char((j & 1) + '0');
  }
  cout << ans << "\n";
  return 0;
}