import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


/********/
uint x = 0, y = 1, z = 2, w = 3;
uint generate() { 
    uint t = (x^(x<<11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
    return w;
}
/********/

void init(uint seed) {
  x = 0, y = 1, z = 2, w = 3;
  x = seed;
}


enum N = 10000001;

void main() {
  try {
    for (; ; ) {
      const SEED = readToken.to!uint;
      
      auto cntH = new int[1 << 16];
      init(SEED);
      foreach (i; 0 .. N) {
        const a = generate();
        ++cntH[a >> 16];
      }
      
      int sumH;
      int jH;
      foreach (j; 0 .. 1 << 16) {
        if (sumH + cntH[j] >= (N + 1) / 2) {
          jH = j;
          break;
        }
        sumH += cntH[j];
      }
      
      auto cntL = new int[1 << 16];
      init(SEED);
      foreach (i; 0 .. N) {
        const a = generate();
        if ((a >> 16) == jH) {
          ++cntL[a & ((1L << 16) - 1)];
        }
      }
      
      int sumL;
      int jL;
      foreach (j; 0 .. 1 << 16) {
        if (sumH + sumL + cntL[j] >= (N + 1) / 2) {
          jL = j;
          break;
        }
        sumL += cntL[j];
      }
      
      uint ans;
      ans |= cast(uint)(jH) << 16;
      ans |= cast(uint)(jL);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}