#include <iostream>

long long c1 = 0, c2 = 0, c3 = 0;
long long x = 0, y = 1, z = 2, w = 3;
long long seed;


void initialize() {
	x = seed;
	y = 1;
	z = 2;
	w = 3;
	c1 = 0;
	c2 = 0;
	c3 = 0;
}

long long generate() {
	long long t = (x ^ (x << 11)) & ((1L << 32) - 1);
	x = y & ((1L << 32) - 1);
	y = z & ((1L << 32) - 1);
	z = w & ((1L << 32) - 1);
	w = ((w ^ (w >> 19)) ^ (t ^ (t >> 8))) & ((1L << 32) - 1);
	return w;
}


int main() {
    std::cin >> seed;
	initialize();
	int n = 10000001;
	int a[1 << 16];
	for (int i = 0; i < 10000001; ++i) {
		++a[(int) (generate() >> 16)];
	}
	int sum = 0;
	int p = 0;
	while (sum < 5000001) {
		sum += a[p];
		++p;
	}
	p = p - 1;
	long long gt = std::max(0LL, (1LL << 16) * (p - 1)), el = std::min((long long) (1LL << 16) * (p + 1), (1LL << 32) - 1);
	while (true) {
		long long m = (gt + el) / 2;
		initialize();
		for (int i = 0; i < 10000001; ++i) {
			generate();
			if (w < m)
				++c1;
			else if (w == m)
				++c2;
			else
				++c3;
		}
			if (c1 + c2 < 5000001) {
			gt = m;
		} else {
			el = m;
		}
		if (c1 + c2 >= 5000001 && c2 + c3 >= 5000001) {
			std::cout << m << std::endl;
			return 0;
		}
	}
}