#include<iostream>
using namespace std;
typedef long long lint;
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(void) {
    uint32_t seed; cin >> seed; 
    uint32_t a=0,b=0xffffffffU;
    while(b-a>1){
      x = seed;
      y=1,z=2,w=3;
      uint32_t k=a+(b-a)/2;
      int c=0;
      for (int i = 0; i < 10000001; i++) {
	if(generate()<=k)c++;
      }
      if(c>=5000001)b=k;
      else a=k;
    }
    cout<<b<<endl;
}