#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
//#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
//#define EXIST(s, e) ((s).find(e)!=(s).end())
//#define SORT(c) sort(begin(c),end(c))
//#define pb emplace_back
//#define MP make_pair
//#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
uint32_t x = 0, y = 1, z = 2, w = 3;
int seed;

uint32_t generate() {
    uint32_t t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    return w;
}

void reset() {
    x = seed;
    y = 1;
    z = 2;
    w = 3;
}

//num以下の数が何回登場するか
int count(ll num) {
    reset();
    int ret = 0;
    for (int i = 0; i < 10000001; i++) {
        if (generate() <= num) ret++;
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> seed;
    x = seed;
    const int lim = 5000000;
    ll low = 0,high = (1ll << 32) - 1;
    int low_num = count(low);
    int high_num = count(high);


    int ii = 100;
    while(ii--){
//        if(low_num < lim && high_num >= lim){
//            break;
//        }
        ll mid = (low + high) / 2;
        int mid_num = count(mid);
        if(mid_num <= lim){
            low_num = mid_num;
            low = mid;
        }else{
            high_num = mid_num;
            high = mid;
        }

    }
    cout << high << endl;
    return 0;

}