#include <bits/stdc++.h>
#include <math.h>

using namespace std;

// c++ short types
#define vt vector
typedef long long ll;
typedef long double ld;

void whattime() { cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl; }

const ll inf = 1e18;

const int base = 1e9;

typedef vt<int> lnum;
void print(lnum a) {
	printf ("%d", a.empty() ? 0 : a.back());
	for (int i=(int)a.size()-2; i>=0; --i)
		printf ("%09d", a[i]);
}
lnum read() {
	string s; cin >> s;
	lnum a;
	for (int i=(int)s.length(); i>0; i-=9)
		if (i < 9)
			a.push_back (atoi (s.substr (0, i).c_str()));
		else
			a.push_back (atoi (s.substr (i-9, 9).c_str()));
		return a;
}
void add(lnum &a, lnum b) {
	int carry = 0;
	for (size_t i=0; i<max(a.size(),b.size()) || carry; ++i) {
		if (i == a.size())
			a.push_back (0);
		a[i] += carry + (i < b.size() ? b[i] : 0);
		carry = a[i] >= base;
		if (carry)  a[i] -= base;
	}
}
void subtract(lnum &a, lnum b) {
	int carry = 0;
	for (size_t i=0; i<b.size() || carry; ++i) {
		a[i] -= carry + (i < b.size() ? b[i] : 0);
		carry = a[i] < 0;
		if (carry)  a[i] += base;
	}
	while (a.size() > 1 && a.back() == 0)
		a.pop_back();
}
void divide(lnum &a, int b) {
	int carry = 0;
	for (int i=(int)a.size()-1; i>=0; --i) {
		long long cur = a[i] + carry * 1ll * base;
		a[i] = int (cur / b);
		carry = int (cur % b);
	}
	while (a.size() > 1 && a.back() == 0)
		a.pop_back();
}
bool comp(lnum &a, int b) {
	while (a.size() > 1 && a.back() == 0)
		a.pop_back();
	// ? a >= b
	if(a.size() == 0) {
		return b == 0;
	} else if(a.size() == 1) {
		return a[0] >= b;
	}
	return true;
}
bool comp(lnum &a, lnum &b) {
	while (a.size() > 1 && a.back() == 0)
		a.pop_back();
	while (b.size() > 1 && b.back() == 0)
		b.pop_back();
	if(a.size() < b.size()) {
		return false;
	} else if(a.size() > b.size()) {
		return true;
	}
	for(int i = a.size() - 1; i >= 0; --i) {
		if(a[i] > b[i]) {
			return true;
		} else if(a[i] < b[i]) {
			return false;
		}
	}
	return true;
}

const int nmax = 1e6;
int a[nmax];

void precalc() {
	vt<int> used(nmax);
	for(int i = 1; i < nmax; ++i) {
		int x = (i - 2) / 2;
		used[i] = (x * 2 + 2 != i) || not used[x];
		a[i] = a[i-1] + used[i];
	}
}

lnum dumb(int n) {
	return {a[n]};
}

lnum solve(lnum n) {
//	lnum n = read();
	if(n == vt<int>(1, 1)) {
//		cout << "1\n";
		return {1};
	} else if(n == vt<int>(1, 2)) {
//		cout << "2\n";
		return {2};
	} else if(n == vt<int>(1, 3)) {
//		cout << "3\n";
		return {3};
	} else if(n == vt<int>(1, 4)) {
//		cout << 3 << "\n";
		return {3};
	}
	vt<lnum> cnt;
	lnum value = n;
	add(value, {2});
	lnum power = {3};
	for(int k = 0; k <= 5000; ++k) {
		if(not comp(value, power)) {
//			if(cnt.back() != vt<int>(1, 0)) {
//				cnt.push_back({0});
//			}
			break;
		}
		lnum delta = value;
		subtract(delta, power);
		for(int z = 0; z <= k; ++z) {
			divide(delta, 2);
		}
		cnt.push_back(delta);
		add(power, power);
	}
	lnum res = {};
	for(int i = cnt.size() - 1; i >= 0; --i) {
//		print(cnt[i]);
//		cout << "\n";
		lnum delta = cnt[i];
		if(i + 1 < cnt.size()) {
			subtract(delta, cnt[i+1]);
		} else {
			add(delta, {+1});
		}
		for(int j = 1; j <= (i+2) / 2; ++j) {
			add(res, delta);
		}
	}
	{
		value = n;
		add(value, {2});
		lnum power = {4};
		for(int k = 0; k <= 5000; ++k) {
			if(not comp(value, power)) {
				// (k-1) / 2
				add(res, {(k-1+2) / 2});
				break;
			}
			add(power, power);
		}
	}
//	print(res);
	return res;
}

int main()
{
//	print(solve({8}));
//	return 0;
	print(
		solve(read())
		);
	return 0;
	precalc();
	for(int n = 1; n < nmax; ++n) {
		if(solve({n}) != dumb({n})) {
			cout << n << ":\n";
			print(solve({n})); cout << "\n";
			print(dumb({n})); cout << "\n";
			exit(0);
		}
	}
//	int tt = 1;
//	for(int t = 0; t < tt; ++t) {
//		solve();
//	}
	return 0;
}