Problem Statement

Find the median of the sequence $a$.
Since this would be far too easy for all you pros, I have set the memory limit to 32MB.

Input

seed

$|a| = 10000001$ (10 million and 1 elements)
$1 \le seed \le 100000$ The sequence $a$ is generated by a pseudorandom number generation algorithm called XOR Shift, implemented in C++ below.
Note that uint32_t is a 32-bit unsigned integer type.

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;
}

int main(void) {
    int64_t seed; cin >> seed; 
    x = seed;
    uint32_t a[10000001];
    for (int i = 0; i < 10000001; i++) {
        a[i] = generate();
    }
    for (int i = 0; i < 10000001; i++) {
        cout << a[i] << endl;
    }
    return 0;
}

Output

Output the median on one line. Print a newline at the end.

Sample

1

2147058707