#include <bits/stdc++.h>

using namespace std;

uint32_t nums[1000000];

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;
    int N = 10000001;
    int lower = 0;
    int upper = 0;
    uint32_t A = 2140000000;
    uint32_t B = 2155000000;
    int n = 0;
    for (int i = 0; i < 10000001; i++)
    {
        uint32_t x = generate();
        if (x < A)
        {
            lower++;
        }
        else
        {
            if (x > B)
            {
                upper++;
            }
            else
            {
                nums[n] = x;
                n++;
            }
        }
    }
    sort(nums, nums + n);
    uint32_t answer = nums[N / 2 - lower];
    cout << answer << endl;
    return 0;
}