#include 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; } #define N 10000001 #define n (N-1)/2 + 1 uint32_t a[n]; bool make(uint32_t& c) { if (c <= a[0]) { for (int j = n - 1; j > 0; j--) { a[j] = a[j - 1]; } a[0] = c; return true; } for (int i = 0; i < n - 1; i++) { if (a[i] <= c && c < a[i + 1]) { for (int j = n - 1; j > i+1; j--) { a[j] = a[j - 1]; } a[i + 1] = c; return true; } } for (int i = 0; i < n; i++) { if (a[i] == 0) { a[i] = c; break; } } return true; } int main(void) { int64_t seed; std::cin >> seed; x = seed; for (int i = 0; i < N; i++) { uint32_t b = generate()+1; make(b); } std::cout << a[n - 1] << std::endl; return 0; }