#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

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

vector<ll> cand;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>x;
	N=10000001;
	for(i=0;i<N;i+=100000) {
		if(i+100000>=N) {
			for(;i<N;i++) cand.push_back(generate());
		}
		else {
			vector<ll> V;
			FOR(j,100000) V.push_back(generate());
			sort(ALL(V));
			for(j=50000-100;j<50000+100;j++) cand.push_back(V[j]);
		}
	}
	sort(ALL(cand));
	cout<<cand[cand.size()/2-1]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}