#include using namespace std; #define REP(i, n) for (int i=0; i<(n); ++i) #define FOR(i, a, n) for (int i=(a); i<(n); ++i) #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(),(x).end() #define DUMP(x) cerr<<#x<<" = "<<(x)< ostream &operator<<(ostream &os, const vector &v) { os << "["; REP(i, SZ(v)) { if (i) os << ", "; os << v[i]; } return os << "]"; } template ostream &operator<<(ostream &os, const pair &p) { return os << "(" << p.first << " " << p.second << ")"; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using vi = vector; using vll = vector; using vvi = vector; using vvll = vector; const ll MOD = 1e9 + 7; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; const ld eps = 1e-9; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); ll d; cin >> d; ll mul = 10000000; ll l = 0, r = 99999999999ll; while(r - l > 1) { ll mid = (l + r) / 2; ll tmp = mid * mul; ll su = 0; while(tmp > 0) { su += tmp; tmp /= 2; } if(su < d) { l = mid; } else { r = mid; } } //cout << l << " " << r << endl; for(ll i = max(0ll, l-2) * mul;i<=(l+2) * mul;++i) { bool ok = false; ll now = i; ll su = 0; while(now > 0) { su += now; now /= 2; if(su == d) { ok = true; break; } } if(ok) { cout << i << endl; break; } } return 0; }