#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(), (x).end()
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = int64_t;
#define ldout fixed << setprecision(40) 

const int N = 10000001;
uint32_t x = 0, y = 1, z = 2, w = 3;
uint32_t x_org, y_org, z_org, w_org;
uint32_t t = 0;
uint32_t generate() { 
    t = (x^(x<<11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
    return w;
}
void reset(void) {
    x = x_org, y = y_org, z = z_org, w = w_org;
}

ll seed;
ll min_ = 20000000000 , max_ = 23000000000;
ll less_, greater_, equal_, c = 0;
ll guess, maxltguess, mingtguess, median;
ll n;
int main(void) {
    cin >> seed; assert(1<=seed&&seed<=100000);
    x = seed;
    x_org = x, y_org = y, z_org = z, w_org = w;

    /*
    rep(i, N) {
        ll x = generate();
        chmax(max_, x);
        chmin(min_, x);
    }
    */

    while (1) {
        reset();
        guess = (min_+max_)/2;
        less_ = 0; greater_ = 0; equal_ = 0;
        maxltguess = min_;
        mingtguess = max_;
        c = 0;
        rep(i, N) {
            n = generate();
            if (n < guess) {
                less_++;
                if (n > maxltguess) 
                    maxltguess = n;
            } else if (n > guess) {
                greater_++;
                if (n < mingtguess) 
                    mingtguess = n;
            } else {
                equal_++;
            }	
            c = i + 1;
        }
        if (less_ <= (N+1)/2 && greater_ <= (N+1)/2) 
            break;
        if (less_>greater_) 
            max_ = maxltguess;
        else 
            min_ = mingtguess;
    }

    if (less_ >= (N+1)/2) 
        median = maxltguess;
    else if (less_+equal_ >= (N+1)/2) 
        median = guess;
    else 
        median = mingtguess;

    cout << median << endl;

#if 0
    reset();
    vector<ll> a(N);
    rep(i, N) a[i] = generate();
    sort(all(a));
    cout << a[N/2] << endl;
    if (a[N/2] != median) {
        cerr << "NOT MATCH" << endl;
        abort();
    }
#endif

    return 0;
}