#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > >  minHeap;

#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d",&n)
#define scnll(n) scanf("%lld",&n)
#define scn2(n,m) scanf("%d%d",&n,&m)
#define scn3(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scn2ll(n,m) scanf("%lld%lld",&n,&m)
#define atoz(v) v.begin(),v.end()
#define ratoz(v) v.rbegin(),v.rend()
#define Fill(a,v) memset(a,v,sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mod 1000000007
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"

int Set(int N,int pos)
{
    return N=N | (1<<pos);
}
int reset(int N,int pos)
{
    return N = N & ~(1<<pos);
}
bool check(int N,int pos)
{
    return (bool)(N & (1<<pos));
}

inline int addmod(lli x,lli y)
{
    return (x%mod + y%mod)%mod;
}
inline int submod(lli x,lli y)
{
    return (x%mod - y%mod + mod)%mod;
}
inline int mulmod(lli x,lli y)
{
    return (x%mod * y%mod)%mod;
}


inline int nextSubMask(int i, int mask)
{
    return (i-1)&mask;   /// returns next  submask
}

template<typename T>
void we_r_done(T mssg)
{
    cout<<mssg;
    exit(0);
}
const int N = 66000;
map<lli,string>nval, pval;
vector<lli>pos, neg;

string makeB(lli now){
    string b;
    while(now)
    {
        if(now%2)
            b += '1';
        else
            b += '0';
        now /= 2LL;
    }
    reverse(atoz(b));
    return b;
}

lli getV(vector<lli>v , lli mask){
    lli now = 0;
    for(int i=0; i<v.size(); i++)
    {
        if(check(mask,i))
            now += v[i];
    }
    return now;
}

string Merge(string a , string b){
    while(a.size() != b.size()){
        if(a.size()<b.size()) a = "0" + a;
        else b = "0" + b;
    }
    for(int i=0; i<a.size(); i++){
        a[i] = (a[i]=='1'||b[i]=='1'? '1' : '0');
    }
    return a;
}

string solve(lli n){

    if(n == 0) return "0";

    for(auto it : pval){
        if(n == it.fi) return it.se;
        if(nval.find(n-it.fi) != nval.end()){
            return Merge(it.se, nval[n-it.fi]);
        }
    }
    for(auto it : nval){
        if(n == it.fi) return it.se;
    }
    assert(false);
}

int main()
{
    ///freopen("output.txt","w",stdout);
   // freopen("input.txt","r",stdin);
    FastIO;

    for(int i=0; i<32; i++)
    {
        if(i%2 == 0)
            pos.pb(1LL<<i);
        else
            neg.pb(1LL<<i);
    }

    for(int mask=1; mask<N; mask++)
    {
        lli now = getV(pos,mask);
        pval[now] = makeB(now);

        now = getV(neg,mask);
        nval[-now] = makeB(now);
    }


    lli n;

    while(cin>>n)
    {
        cout<<solve(n)<<endl;
    }

    return 0;
}

///sin and cos expect input in radians not degrees. so use , sin(degrees * pi / 180)
///using bs = bitset<MX>; // how many distinct number can be form?
///sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b : x.a<y.a);});


Measured memory_bytes: 18688