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

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(){
    int seed;
    cin >> seed;
    x = seed;
    vector<uint32_t> nums;
    for(int i = 0; i < 10000001; i++) {
        nums.push_back(generate());
    }
    sort(nums.begin(), nums.end());
    cout << nums[int(5e6)] << endl;
}