#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main(void) {
  ll n;
  cin >> n;

  vector<ll> a;
  ll sum = 0;
  while (n) {
    a.push_back(n);
    sum += n;
    n >>= 1;
  }

  vector<ll> cum = a;
  for (int i = cum.size() - 2; i >= 0; i--) {
    cum[i] += cum[i + 1];
  }

  ll ans = 0;
  for (int i = 0; i < a.size(); i++) {
    if (2 * a[i] < cum[i]) {
      ans += a[i];
    } else {
      ans += 2 * a[i];
      break;
    }
  }
  cout << ans - sum << endl;

  return 0;
}