#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<functional>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265358979

using namespace std;
typedef pair<int, int> P;

int main(void) {
	long long int n;
	long long int p, q;
	long long int r = 0;
	long long int point = 0, count = 0;
	long long int pos = 0;

	cin >> n;
	p = n;
	q = n;

	while (1) {
		point += p;
		p /= 2;
		r++;
		if (p == 0) {
			break;
		}
	}

	FOR(i, 0, r) {
		pos = 0;
		q = n;
		RFOR(t, i, 1) {
			pos += q;
			q /= 2;
		}
		pos += q * 2;
		if (pos > count) {
			count = pos;
		}
		else {
			break;
		}
	}

	cout << count - point << endl;

	return 0;
}