#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define gc getchar
#define pc putchar
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

template <class T = int> T read() {
  T x = 0; bool f = 0; char ch = gc();
  while (!isdigit(ch)) f = ch == '-', ch = gc();
  while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc();
  return f ? -x: x;
}
template <class T> void write(T x) {
  if (x >= 0) { if (x > 9) write(x / 10); pc(x % 10 + 48); }
  else { pc('-'); if (x < -9) write(-x / 10); pc(48 - x % 10); }
}

const int N = 1000010;

int n, k, fa[N], to[N], val[N], sz[N], tar[N];

int find(int x) {
  return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void merge(int x, int y) {
  x = find(x), y = find(y);
  if (x == y) return;
  fa[x] = y, sz[y] += sz[x]; 
}

void print(int x) {
  per (i, k, 1) write(x >> i & 1);
  rep (i, 1, n - k) write(x & 1), x = tar[x];
}

int main() {
  n = read();
  if (n == 1) return puts("0"), 0;
  if (n == 2) return puts("01"), 0;
  while ((1 << (k + 1)) + k < n) k++;
  rep (i, 0, (1 << k) - 1) fa[i] = i;
  rep (i, 0, (1 << (k - 1)) - 1) {
    to[i] = (2 * i) & ((1 << k) - 1);
    merge(i, (2 * i) & ((1 << k) - 1));
  }
  rep (i, (1 << (k - 1)), (1 << k) - 1) {
    to[i] = (2 * i + 1) & ((1 << k) - 1);
    merge(i, (2 * i + 1) & ((1 << k) - 1));
  }
  rep (i, 0, (1 << (k - 1)) - 1) {
    int u = i, v = i + (1 << (k - 1));
    int uu = (2 * u) & ((1 << k) - 1);
    int vv = (2 * v + 1) & ((1 << k) - 1);
    if (find(u) == find(v)) continue;
    to[u] = vv, to[v] = uu, merge(u, v);
  }
  rep (i, 0, (1 << k) - 1) val[i] = (i << 1 | (to[i] & 1));
  rep (i, 0, (1 << k) - 1) tar[val[i]] = val[to[i]];
  rep (i, 0, (1 << k) - 1) {
    int u = i, v = i + (1 << k);
    int uu = (2 * u) & ((1 << (k + 1)) - 1);
    int vv = (2 * v + 1) & ((1 << (k + 1)) - 1);
    if (tar[u]) tar[v] = uu ^ vv ^ tar[u];
    else if (tar[v]) tar[u] = vv ^ uu ^ tar[v];
  }
  rep (i, 0, (1 << (k + 1)) - 1) fa[i] = i, sz[i] = 1;
  rep (i, 0, (1 << (k + 1)) - 1) merge(i, tar[i]);
  if (sz[find(val[0])] >= n - k) return print(val[0]), 0;
  rep (i, 0, (1 << k) - 1) {
    int u = i, v = i + (1 << k);
    if (find(u) == find(v)) continue;
    swap(tar[u], tar[v]);
    if (sz[find(u)] < sz[find(v)]) swap(u, v);
    merge(u, v);
    if (sz[find(u)] >= n - k) return print(tar[v]), 0;
  }
}