#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 f(ll n){
    if(n == 0){
        return 0;
    }
    if(n == 1){
        return 0;
    }
    
    if(n % 2 == 0){
        return f(n / 2) + (n / 2);
    }
    return 2ll * f(n / 2);
}

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

    ll N;
    std::cin >> N;

    std::cout << f(N) << std::endl;
}