#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int D; cin >> D;
	int now = 1;
	int ans = D;
	while ((1LL << now) <= D) {
		int L = 0, R = D;
		bool ok = 0;
		while (R - L > 1) {
			int mid = (R + L) / 2;//最初の飛距離
			int m = mid;
			int dis = mid;
			REP(i, now) {
				mid /= 2;
				dis += mid;
			}
			if (mid == 0 || dis < D)L = m;
			else {
				R = m;
				ok = 1;
			}
		}
		int cnt = R;
		int t = R;
		REP(i, now) {
			t /= 2;
			cnt += t;
		}
		if (cnt == D && t)chmin(ans, R);
		now++;
	}
	
	cout << ans << endl;
	return 0;
}