#include <bits/stdc++.h>

using namespace std;

using ll = long long;

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 select(vector< int > &a, int k) {
  for(int l = 0, r = a.size() - 1; l <= r;) {
    int p = a[(l + r) / 2];
    int i = l - 1, j = r + 1;
    while(1) {
      while(a[++i] < p);
      while(a[--j] > p);
      if(i >= j) break;
      swap(a[i], a[j]);
    }
    if(k == i - l) return a[i];
    else if(k < i - l) { r = i - 1; }
    else if(k > i - l) {
      k -= (i - l + 1);
      l = j + 1;
    }
  }
  return -99999999; // k < 0 || k >= n
}

int main() {
  ll seed;
  cin >> seed;
  x = seed;

  int low = 0;
  const ll mid = 1LL << 31;
  const ll shift = 2000000;
  int a[4000001] = {};

  for(int i = 0; i < 10000001; i++) {
    ll v = generate();
    if(mid - shift <= v && v <= mid + shift) ++a[v - mid + shift];
    else if(v < mid - shift) ++low;
  }

  int rest = 5000001 - low;
  for(int i = -shift; i <= shift; i++) {
    rest -= a[i + shift];
    if(rest == 0) {
      cout << i + mid << endl;
      break;
    }
  }
  return 0;
}