#include <string>
#pragma GCC optimize("Ofast")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(__CYGWIN__) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define ssz(x) (signed((x).size()))
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c - '0'); c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr int MAXN = 5e5 + 5;
int n, cur[MAXN];
vector<int> G[MAXN], G2[MAXN], st, cyc, cyc2[MAXN];
bool used[MAXN];
void dfs(int x) {
  for (int i = cur[x]; i < ssz(G[x]); i = cur[x]) {
    cur[x] = i + 1, dfs(G[x][i]);
  }
  st.eb(x);
}
vector<int> getCyc(int x) {
  vector<int> ans;
  int p = x;
  // cerr << x << " | ";
  do {
    assert(cur[p] < ssz(G2[p]));
    p = G2[p][cur[p]++], ans.eb(p);
    // cerr << p << ' ';
  } while (p != x);
  // cerr << '\n';
  return ans;
}

void Main() {
  read(n);
  if (n == 1) {
    cout << "0\n";
    return;
  } else if (n == 2) {
    cout << "01\n";
    return;
  } else if (n == 3) {
    cout << "010\n";
    return;
  } else if (n == 4) {
    cout << "0110\n";
    return;
  } else if (n == 5) {
    cout << "00110\n";
    return;
  }
  int k = 1;
  while ((2 << k) <= n - (k + 1))
    k++;
  // cerr << k << '\n';
  assert(k > 1);
  int S = 1 << k;
  For(i, 0, S - 1) {
    int fr = i >> 1, to = i & (S / 2 - 1);
    G[fr].eb(to);
  }
  dfs(0), reverse(st.begin(), st.end());
  For(i, 1, ssz(st) - 1) {
    int v = st[i - 1] << 1 | (st[i] & 1);
    cyc.eb(v);
  }
  // cerr << "=== BIG ===\n";
  // for (int x : cyc)
  //   cerr << x << ' ';
  // cerr << '\n';
  int lft = n - (ssz(cyc) + k);
  memset(cur, 0, sizeof cur);
  For(i, 1, ssz(cyc) - 1) used[cyc[i - 1] << 1 | (cyc[i] & 1)] = 1;
  used[cyc.back() << 1 | (cyc[0] & 1)] = 1;
  For(i, 0, (S << 1) - 1) if (!used[i]) {
    int fr = i >> 1, to = i & (S - 1);
    G2[fr].eb(to);
  }
  int st = 0;
  // cerr << lft << '\n';
  For(i, 0, ssz(cyc) - 1) {
    if (!lft)
      break;
    int x = cyc[i];
    if (cur[x] == ssz(G2[x]))
      continue;
    cyc2[i] = getCyc(x);
    if (ssz(cyc2[i]) > lft) {
      st = i;
      cyc2[i].erase(cyc2[i].begin() + lft, cyc2[i].end());
      lft = 0;
    } else
      lft -= ssz(cyc2[i]);
  }
  assert(!lft);
  ForDown(i, k - 1, 0) putchar((cyc[st] >> i & 1) + '0');
  for (int i = (st + 1) % ssz(cyc);; (i += 1) %= ssz(cyc)) {
    putchar('0' + (cyc[i] & 1));
    for (int j : cyc2[i])
      putchar('0' + (j & 1));
    if (i == st)
      break;
  }
}
} // namespace

signed main() { return Main(), 0; }

// 00110