#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    ll cnt = 0, cur = n;
    while(cur > 0) {
        cur /= 2;
        cnt++;
    }
    vector<vector<ll>> dp(cnt + 1, vector<ll>(2, 0));
    cur = n;
    rep(i, cnt) {
        dp[i + 1][0] = dp[i][0] + cur;
        dp[i + 1][1] = max(dp[i][0] + cur * 2, dp[i][1]);
        cur /= 2;
    }
    cout << (dp[cnt][1] - dp[cnt][0]) << endl;
    return 0;
}