#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

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;

  uint32_t ok = 0;
  uint32_t ng = UINT_MAX;
  uint32_t a = 10000001;

  while (ng - ok >= 2) {
    uint32_t mid = (ok + ng) / 2;
    int m_cnt = 0;
    x = seed;
    y = 1;
    z = 2;
    w = 3;

    for (int i = 0; i < a; ++i) {
      uint32_t v = generate();
      if (v <= mid) {
        ++m_cnt;
      }
    }

    if (m_cnt <= a / 2 + 1) {
      ok = mid;
    } else {
      ng = mid;
    }
  }

  cout << ok << endl;

  return 0;
}