#include <iostream>
#include <algorithm>

using namespace std;
uint32_t x = 0, y = 1, z = 2, w = 3;
uint32_t a[6000001];

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;
    int l1bcnt = 0;
    int index = 0;
    for (int i = 0; i < 10000001; i++) {
        uint32_t next_num = generate();
        if (next_num < 1000000000) {
            l1bcnt++;
        } else if (next_num < 3000000000L) {
            a[index] = next_num;
            index++;
        } 
    }
    int median_index = 10000001 / 2 - l1bcnt;
    sort(a, a + index);
    cout << a[median_index] << endl;
}