#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  if (n == 1) {
    cout << "1" << '\n';
    return 0;
  }
  if (n == 2) {
    cout << "01" << '\n';
    return 0;
  }
  if (n == 3) {
    cout << "010" << '\n';
    return 0;
  }
  int k = 0;
  while ((1 << k) + k - 1 <= n) {
    k += 1;
  }
  k -= 1;
  int mx = (1 << k) - 1;
  map<int, bool> was;
  vector<int> order;
  function<void(int)> Dfs = [&](int x) {
    x = (x & mx);
    if (was[x]) {
      return;
    }
    was[x] = true;
    order.push_back(x);
    Dfs(x << 1 | 1);
    Dfs(x << 1);
  };
  Dfs(0); 
  if (n == (1 << k) + k - 1) {
    for (int i = 0; i + 1 < k; i++) {
      cout << 0;
    }
    for (int i : order) {
      cout << i % 2;
    }
    cout << '\n';
    return 0;
  }
  int sz = (int) order.size();
  for (int i = 0; i < sz; i++) {
    order[i] = order[i] * 2;  
    if (i + 1 < sz) {
      order[i] |= (order[i + 1] % 2);
    }
  }
  map<int, int> go;
  for (int i = 0; i < sz; i++) {
    go[order[i]] = order[(i + 1) % sz];
  }
  for (int i = 0; i < (1 << (k + 1)); i++) {
    if (!go.count(i)) {
      go[i] = go[i ^ (1 << k)] ^ 1;
    }
  }
  Dfs = [&](int x) {
    if (was[x]) {
      return;
    }
    was[x] = true;
    order.push_back(x);
    Dfs(go[x]);
  };
  was.clear();
  for (int i : order) {
    was[i] = true;
  }
  for (int i = 1; i < (1 << (k + 1)); i++) {
    if (was[i]) {
      continue;
    }
    Dfs(i);
    swap(go[i], go[i ^ (1 << k)]);
    if (n <= (int) order.size() + k) {
      int f = go[i];
      for (int b = k; b > 0; b--) {
        cout << (f >> b & 1);
      }
      for (int i = 0; i < n - k; i++) {
        cout << f % 2;
        f = go[f];
      }
      cout << '\n';
      return 0;
    }
  }
  return 0;
}