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

struct BigInt {
    vector<long long> v;
    long long base = 1000000000;
    BigInt() {
        v.push_back(0);
    }
    void add(long long a) {
        int index = 0;
        while (index < v.size()) {
            v[index] += a;
            a = v[index] / base;
            v[index] %= base;
            if (a == 0) return;
            index++;
        }
        if (index == v.size()) {
            v.push_back(a);
        }
    }
    void mul2() {
        int index = 0;
        long long add = 0;
        while (index < v.size()) {
            v[index] = v[index] * 2 + add;
            add = v[index] / base;
            v[index] %= base;
            index++;
        }
        if (add != 0) v.push_back(add);
    }
    void print() {
        for (int i = v.size()-1; i >= 0; i--) {
            if (i != v.size()-1) printf("%09d", (int) v[i]);
            else printf("%d", v[i]);
        }
        printf("\n");
    }
};

int main() {
    int n; cin >> n;
    vector<long long> d(2000, 0), e(2000, 0);
    d[1] = 1; e[1] = 1;
    int digit;
    for (int i = 1; i < 2000; i++) {
        d[i+1] = d[i] + max(0, i-1);
        e[i+1] = e[i] + d[i+1];
        if (e[i] >= n) {
            digit = i;
            n -= e[i-1];
            break;
        } 
    }
    vector<int> bin(digit, 0);
    bin[0] = 1; int index = 1;
    bin[digit-1] = 1;
    while (n > 0) {
        if (n > digit-index-1 && n != 1) {
            n -= digit-index-1;
            bin[index] = 1; index++;
            continue;
        } else {
            for (int i = 0; i < n; i++) {
                bin[digit-i-1] = 1;
            }
            break;
        }
    }
    BigInt ans;
    for (int i = 0; i < digit; i++) {
        ans.mul2();
        if (bin[i]) ans.add(1); 
    }
    ans.print();
    return 0;
}