#include <bits/stdc++.h>
using namespace std;

template <typename T>
class Array : public vector<T> {
 public:
  using vector<T>::vector;
  using vector<T>::begin;
  using vector<T>::end;
  using vector<T>::push_back;
  template <typename R>
  Array<R> map(function<R(T)> f) {
    Array<R> res(end() - begin());
    for (auto it = begin(); it != end(); ++it) res[it - begin()] = f(*it);
    return res;
  }
  Array<T> select(function<bool(T)> f) {
    Array<T> res;
    for (auto it = begin(); it != end(); ++it)
      if (f(*it)) res.push_back(*it);
    return res;
  }
  template <typename R>
  R reduce(R u, function<R(R, T)> f) {
    for (auto it = begin(); it != end(); ++it) u = f(u, *it);
    return u;
  }
  template <typename U>
  Array<pair<T, U>> zip(const Array<U> &b) {
    assert(end() - begin() == b.end() - b.begin());
    Array<pair<T, U>> res;
    for (auto it = begin(); it != end(); ++it)
      res.push_back({*it, b[it - begin()]});
    return res;
  }
  Array<T> iota(T st) {
    Array<T> res(end() - begin());
    ::iota(res.begin(), res.end(), st);
    return res;
  }
};

signed main() {
  ios::sync_with_stdio(false);

  int seed;
  cin >> seed;

  struct Rng {
    uint32_t x, y, z, w;
    Rng(int seed) : x(seed), 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;
    }
  };

  const int N = 10000001;

  uint64_t lb = 0, ub = 1ULL << 32;
  while (ub - lb > 1) {
    Rng rng(seed);
    uint64_t mb = lb + ub >> 1;
    int lcnt = 0;
    for (int i = 0; i < N; ++i) lcnt += rng.generate() < mb;
    (lcnt * 2 < N ? lb : ub) = mb;
  }
  
  cout << lb << endl;
  
  return 0;
}