#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

ll rec(ll n){
    if(n == 0){
        return 0;
    }

    ll mx = max(2ll * n, rec(n >> 1));
    return mx;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    ll N;
    std::cin >> N;
    
    ll x = 0, y = rec(N);
    {
        ll n = N;
        while(n > 0){
            x += n;
            n >>= 1;
        }
    }

    std::cout << (y - x) << std::endl;
}