#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


#define negate negate__

string shift(const string &s, const string &suf) {
  const int len = s.size();
  const string ss = s + s;
  const int pos = ss.find(suf);
  const int cut = (pos + (int)suf.size()) % len;
  return s.substr(cut) + s.substr(0, cut);
}
string partialSum(const string &s) {
  string ret;
  int sum = 0;
  for (const char c : s) {
    sum ^= (c - '0');
    ret += (char)('0' + sum);
  }
  return ret;
}
string negate(const string &s) {
  string ret;
  for (const char c : s) {
    ret += (char)(c ^ '0' ^ '1');
  }
  return ret;
}
string otimes(int k, string s, string t) {
  { const int pos = (s + s).find(string(k, '0')); assert(~pos); s = s.substr(pos) + s.substr(0, pos); }
  { const int pos = (t + t).find(string(k, '0')); assert(~pos); t = t.substr(pos) + t.substr(0, pos); }
  { const int pos = (s + s).find(string(k, '1')); assert(~pos); s.insert(s.begin() + pos, '1'); }
  { const int pos = (s + s).find(string(k, '0')); assert(~pos); s.erase(s.begin() + pos); }
  { const int pos = (t + t).find(string(k, '0')); assert(~pos); t.insert(t.begin() + pos, '0'); }
  { const int pos = (t + t).find(string(k, '1')); assert(~pos); t.erase(t.begin() + pos); }
  return s + t;
}

constexpr int K = 18;
string S[K + 1];

int main() {
  // https://www.mimuw.edu.pl/~rytter/MYPAPERS/paper.pdf
  {
    S[1] = "01";
    S[2] = "0011";
    string x = "0011";
    string y = "0011";
    for (int i = 2; ; ++i) {
// if(i<=5)cerr<<x<<" "<<y<<endl;
      S[i + 1] = otimes(i, x, y);
// if(i<=5)cerr<<"S["<<i+1<<"] = "<<S[i+1]<<endl;
      if (i + 1 == K) break;
      x = shift(x, string(i, '1'));
      string x1 = partialSum(x);
      string x2 = negate(x1);
      x = x1 + shift(x2, x1.substr((int)x1.size() - i));
      y = shift(y, string(i, '1'));
      string y1 = partialSum(y);
      string y2 = negate(y1);
      y = y1 + shift(y2, y1.substr((int)y1.size() - i));
      y = negate(y);
 }
  }
  for (int k = 1; k <= K; ++k) {
    assert((int)S[k].size() == 1 << k);
    const string pre = S[k].substr(0, k - 1);
    S[k] += pre;
  }
#ifdef LOCAL
  for (int k = 1; k <= K; ++k) {
    {
      set<string> ss;
      for (int i = 0; i + k <= (int)S[k].size(); ++i) {
        ss.insert(S[k].substr(i, k));
      }
      assert((int)ss.size() == 1 << k);
    }
    if (k >= 2) {
      const int n = (int)S[k - 1].size() + 1;
      set<string> ss;
      for (int i = 0; i + (k - 1) <= n; ++i) {
        ss.insert(S[k].substr(i, k - 1));
      }
// cerr<<k<<" "<<S[k]<<" "<<n<<"; ";pv(ss.begin(),ss.end());
      assert((int)ss.size() == 1 << (k - 1));
    }
  }
#endif
  
  int N;
  for (; ~scanf("%d", &N); ) {
    string ans;
    for (int k = 1; ; ++k) {
      if (N <= (int)S[k].size()) {
        ans = S[k].substr(0, N);
        break;
      }
    }
    puts(ans.c_str());
  }
  return 0;
}