#include <iostream>
#include <map>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
#include <queue>
#include <bitset>
#define ll long long

using namespace std;

const int N = 1e6;
int a;
int x[N];

int main(){
    cin >> a;
    if(a == 0) cout << 0 << endl;
    else{
        int t = 0;
    while(a){
        x[++t] = a & 1;
        a /= 2;
    }
    for (int i = t; i >= 1; i -- ) cout << x[i];
    }
}