#include <stdio.h>
#include <stdlib.h>

typedef unsigned long ul;
const int N = 10000001;
const ul min = 2144000000;
const ul max = 2150000000;
ul a[100000] = {0};

ul x = 0, y = 1, z = 2, w = 3;
static inline ul generate(void) {
  ul t = (x^(x<<11));
  x = y;
  y = z;
  z = w;
  w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
  return w;
}

static inline int cmp(const void *a, const void *b) {
  ul aa = *(ul*)a;
  ul bb = *(ul*)b;

  if (aa > bb)
    return 1;
  else if (aa < bb)
    return -1;
  else
    return 0;
}

ul f(const ul seed) {
  x = seed;
  int min_cnt = 0;
  int a_idx = 0;

  for (int i = 0; i < N; i++) {
    ul r = generate();
    if (r < min)
      ++min_cnt;
    else if (r <= max)
      a[a_idx++] = r;
  }
  qsort(a, a_idx, sizeof(ul), cmp);
  ul med = a[N/2 - min_cnt];
  return med;
}

int main(void) {
  ul seed;
  scanf("%u", &seed);

  ul med = f(seed);
  printf("%u\n", med);

  return 0;
}