#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;

void solve(int test_case){
	int i, j;
	cin >> n;
	m = __builtin_popcountll(n);
	if(m == 1){
		cout << n << '\n';
		return;
	}
	int all = (1ll<<m);
	a[0] = 1;
	if(n&1)a[0]++;
	for(i=1;i<61;i++){
		int t = (1ll<<i);
		a[i] = a[i-1];
		if(n&t)a[i]<<=1ll;
	}
	int need = (all/2);
	int ans = 0;
	//~ for(i=0;i<60;i++){
		//~ cout << a[i] << '\n';
	//~ }cout << '\n';
	for(i=60;i>0;i--){
		int t = (1ll<<i);
		//~ cout << t << '\n';
		if((n&t) == 0){
			continue;
		}else {
			//~ cout << need << ' ' << a[i-1] << '\n';
			if(need - a[i-1] >= 0)ans += t, need -= a[i-1];
			else continue;
		}
	}
	//~ cout << need << '\n';
	cout << ans << '\n';
	return;
}
// 35184372088831
// 36028797018963967
// 1073741823
signed main(){
	FASTIO;
//~ #define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}
/*

7
000
001
010
011
100
101
110
111

*/