#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
unsigned int x = 0, y = 1, z = 2, w = 3;
unsigned int  generate() { 
    unsigned int  t = (x^(x<<11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
    return w;
}

int main(int argc, char* argv[])
{
    long long seed; 
	cin >> seed; 
    x = seed;
	const int MAX=10000001;
	vector<unsigned int> v[12];
	int i;
	for (i = 0; i < MAX; i++) {
		unsigned int val=generate();
		if (val<=      100000000){
			v[0].push_back(val);
		}else if (val<=500000000){
			v[1].push_back(val);
		}else if (val<=700000000){
			v[2].push_back(val);
		}else if (val<=1000000000){
			v[3].push_back(val);
		}else if (val<=1500000000){
			v[4].push_back(val);
		}else if (val<=2000000000){
			v[5].push_back(val);
		}else if (val<=2500000000){
			v[6].push_back(val);
		}else if (val<=3000000000){
			v[7].push_back(val);
		}else if (val<=3500000000){
			v[8].push_back(val);
		}else if (val<=4000000000){
			v[9].push_back(val);
		}else if (val<=5000000000){
			v[10].push_back(val);
		}else{
			v[11].push_back(val);
		}
    }
	int L[12];
	const int MID=MAX/2;
	int N=0;
	int I;
	for (i=0;i<12;i++){
		L[i]=v[i].size();
		if (N+L[i]<MID){
			N+=L[i];
		}else{
			I=i;
			break;
		}
	}
	for (i=0;i<12;i++){
		if (i!=I){
			v[i].clear();
		}
	}
	sort(v[I].begin(),v[I].end());
	cout<<v[I][MID-N]<<endl;
	return 0;
}