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

int main(){
    long long int N, max = 0, point1 = 0;
    vector <long long int> point2;

    cin >> N;
    while(N > 0){
        point2.push_back(point1 + N*2);
        if(max <= point2.back()){
            max = point2.back();
        }

        point1 += N;
        N = N/2;
    }
    cout << max - point1 << endl;

    return 0;
}