#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long D;
    cin >> D;
    long long temp = 1;
    int cnt = 0;
    vector<long long> rui(60);
    rui[0] = 1;
    for(int i = 1; i < 60; i++){
        rui[i] = rui[i - 1] * 2;
        if(rui[i] > D + 1) break;
    }
    vector<vector<long long>> dp(60, vector<long long> (60));
    for(int i = 0; i < 60; i++){
        if(rui[i] > D) break;
        for(int j = 0; j < 60; j++){
            if(j > i) dp[i][j] = dp[i][j - 1];
            else{
                if(j == 0) dp[i][j] = rui[i - j];
                else dp[i][j] = dp[i][j - 1] + rui[i - j];
            }
        }
    }
    long long ans = D;
    for(int i = 0; i < 60; i++){
        long long res = 0;
        long long temp = D;
        for(int j = 59; j >= 0; j--){
            if(dp[j][i] == 0) continue;
            if(temp >= dp[j][i]) {
                temp -= dp[j][i];
                res += rui[j];
            }
        }
        if(temp == 0) ans = min(ans, res);
    }
    cout << ans << endl;
}