#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    ll n;
    cin >> n;
    for (int i = 59; i >= 0; --i) {
        if(n & (1LL << i)){
            cout << (1LL << i) << "\n";
            return 0;
        }
    }
    return 0;
}