#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<math.h>
#include<tuple>
#include<string.h>
#include <numeric> 
#include<unordered_map>
using namespace std; 
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...) "\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x,y) debug() << pp(x) pp(y)
#define dg3(x,y,z) debug() << pp(x) pp(y) pp(z)
#define dg4(w,x,y,z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin() , x.end()
#define clr(x) memset(x , 0 , sizeof x);
#define sz(x) (int)x.size()
template<typename T> void db(T x ){ debug() <<">>> " <<  x; }
template<typename T> void db(T x , T y){ debug() <<">>> " <<  x <<" , "<< y; }
template<typename T> void db(T x , T y , T z){ debug() <<">>> "<< x <<" , "<< y <<" , "<< z; }
template<typename T> void db(T x , T y , T z , T a){ debug() <<">>> "<< x <<" , " << y <<" , "<< z <<" , "<< a; }
const int xx = 2e5;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;

signed main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  int N;
  cin >> N;

  if(N == 0 || N == 1){
    cout << N << '\n';
    return 0;
  }
  vector<int> evP, oddP;

  for(int i = 1; i<= 33; i+= 2){
    int x = (1ll << i);
    x = x * -1;
    oddP.push_back(x);
  }
  for(int j = 0; j <= 34; j += 2) {
    evP.push_back(1ll << j);
  }
  dg1(evP);dg1(oddP);
  map<int,int> Sum;
  int M = sz(evP);
  map<int,int> Sno_E , Sno_O;
  Sum[0] = 1;
  for(int i = 1; i < (1 << M); i++) {
    int sum =0;
    for(int j = 0; j < M; j++) {
      if(i & (1 << j) ){
        sum += evP[j];
      }
    }
    Sum[sum] = 1;
    Sno_E[sum] = i;
  }
  dg1(Sum);
  vector<int> odsum = {0};
  int L = sz(oddP);
  for(int i = 1; i <= (1 << L); i++) {
     int sum = 0;
     for(int j = 0; j < L; j++) {
       if(i & (1 << j)) {
         sum += oddP[j];
       }
     }
     Sno_O[sum] = i;
     odsum.push_back(sum);
  }

  int seven  = -1 , sodd = -1;
  dg1(N);
  dg1(odsum);
  for(int i : odsum){
    int x = N - i;
    dg2(i , x);
    if(Sum[x]) {
      seven = Sno_E[x];
      sodd = Sno_O[i];
    }
  }
  if(seven == -1 || sodd == -1){
    cout << 0 << '\n'; return 0;
  }
  vector<char> ans(40 , '0');
  int A = 0 , B = 0;
  for(int i = 0; i < M; i++) {
    if(seven & (1 << i)){
      int x = log2(evP[i]);
      ans[x] = '1';
    }
  }
  for(int i = 0; i < L; i++) {
    if(sodd & (1 << i)) {
      int x = log2(oddP[i] * -1);
      ans[x] = '1';
    }
  }

  bool one = false;
  for(int i = 36; i>= 0; i--) {
    if(ans[i] == '1') one = true;
    if(one){
      cout << ans[i];
    }
  }
  cout << '\n';
}


Measured memory_bytes: 53176