#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll inf =1e18;

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

int n;
uint32_t a,l,r;
int main(){
    ll seed; cin >> seed;
    x = seed;
    vector<uint32_t> vt;
    for (int i = 0; i < 10000001; i++) {
        a = generate();
        if(a<2146000000){
            l++;
        }
        else if(a>2148000000){
            r++;
        }else{
            vt.push_back(a);
        }
    }
    sort(ALL(vt));
    p(vt[5000000-l]);
    return 0;
}