#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define int long long
using namespace std;
const int INF = 1e15;
const int MAX = 100010;

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;
}

signed main(){
    int n = 10000001;
    int64_t seed; cin >> seed; 
    x = seed;
    // uint32_t a[10000001];
    int l = 0, r = 1e10, ans = -1;
    // for (int i = 0; i < n; i++) {
    //     a[i] = generate();
    //     cout << a[i] << endl;
    // }
    int idx = (n + 1) / 2;
    while(1){
        int m = (l + r) / 2;
        int less = 0, eq = 0;
        x = seed; y = 1, z = 2, w = 3;
        rep(i, 0, n){
            int tmp = generate();
            if(tmp < m) less++;
            else if(tmp == m) eq++;
        }
        // cout << m << ' ' << less << ' ' << eq << endl;
        if(less >= idx) r = m;
        else if(less + eq < idx) l = m;
        else{
            ans = m; break;
        }
    }
    cout << ans << endl;
}