#include <limits>
#include <iostream>
#include <algorithm>
#include <iomanip>
#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 = uint32_t;
using namespace std;

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

u32 x = 0, y = 1, z = 2, w = 3;
u32 generate() {
    u32 t = (x^(x<<11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    return w;
}

int main() {
    u32 ng = 2140000000, ok = 2155000000;
    u32 seed; cin >> seed;
    while(ok-ng > 1){
        auto mid = ng + ((ok-ng)>>1);
        uint32_t cnt = 0;
        x = seed, y = 1, z = 2, w = 3;
        for (int i = 0; i < 10000001; ++i) {
            if(generate() <= mid) cnt++;
        }
        (cnt >= 5000001 ? ok : ng) = mid;
    }
    cout << ok << "\n";
    return 0;
}