#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

unsigned int x, y, z, w;
int counts[1 << 16], n = 10000001, seed;

void init() {
	x = seed; 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() {
	cin >> seed; init();
	for (int i = 0; i < n; i++) {
		unsigned int T = generate();
		counts[T / (1 << 16)]++;
	}
	unsigned int s = 0, mid = 0, K = 0;
	for (int i = 0; i < n; i++) {
		if (s + counts[i] > n / 2) { mid = i; K = n / 2 - s; break; }
		s += counts[i];
	}
	vector<unsigned int>F; init();
	for (int i = 0; i < n; i++) {
		unsigned int T = generate();
		if ((mid << 16) <= T && T < ((mid + 1) << 16)) { F.push_back(T); }
	}
	sort(F.begin(), F.end());
	cout << F[K] << endl;
	return 0;
}