#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll d;
  cin >> d;

  auto calc = [&](ll x, ll i) {
    ll t = x, rem = i;
    ll ret = 0;
    REP(j, i) {
      ret += t;
      t /= 2;
    }
    return ret;
  };

  ll ans = d;
  REP(i, 1000) {
    ll ng = 0, ok = d;
    while (abs(ok - ng) > 1) {
      ll m = (ok + ng) / 2;
      ll c = calc(m, i);
      (c >= d ? ok : ng) = m;
    }

    if (calc(ok, i) == d) {
      ans = min(ans, ok);
    }
  }
  cout << ans << endl;
}