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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

typedef uint32_t UT;

const int LIM = 10000001;
// const int LIM = 100001;

UT x, y, z, w;
void init(int64_t v) { x = v; y = 1; z = 2; w = 3; }
UT generate() { 
	UT t = (x^(x<<11));
	x = y;
	y = z;
	z = w;
	w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
	return w;
}

int64_t seed;
int f(UT v) {
	int c = 0, d = 0;
	init(seed);
	inc(i, LIM) {
		UT g = generate();
		if(g == v) { d++; }
		if(g >  v) { c++; }
		if(g <  v) { c--; }
	}
	if(d - 1 >= abs(c)) { return 0; }
	return c;
}

int main(void) {
	cin >> seed;
	
	/*
	UT a[LIM];
	init(seed);
	inc(i, LIM) { a[i] = generate(); }
	inc(i, LIM) { cout << a[i] << endl; }
	cout << endl;
	*/
	
	init(seed);
	UT mi, ma;
	mi = ma = generate();
	inc(i, LIM - 1) {
		setmin(mi, generate());
		setmax(ma, generate());
	}
	
	UT L = mi, H = ma;
	while(H - L > 1) {
		// cout << L << " " << H << endl;
		// UT M = (L + H) / 2;
		UT M = L + (H - L) / 2;
		int res = f(M);
		if(res == 0) { cout << M << endl; return 0; }
		(res > 0 ? L : H) = M;
	}
	
	assert(f(L) == 0);
	cout << L << endl;
}