#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};

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

bool f(int seed, LL m){
    x = seed, y = 1, z = 2, w = 3;
    int cnt = 0;
    for (int i = 0; i < 10000001; i++) {
        if(generate() >= m) cnt++;
    }
    return cnt > 5000000;
}

int main(){
    int64_t seed;cin >> seed;
    LL l = 0, r = 1LL << 35;
    while(r - l > 1){
        LL m = (r + l) / 2;
        if(f(seed, m)) l = m;
        else r = m;
    }
    cout << l << endl;
    return 0;
}