// includes #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} 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(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); int seed; cin >> seed; uint32_t l = 2145000000, r = 2148000000; int itr = 10000001; uint32_t prev = -1; while(r - l > 1){ x = seed, y = 1, z = 2, w = 3; uint32_t m = (l + r) / 2; if(prev == m){ l = m; break; } int b = 0; for(int i = 0; i < itr; i++){ uint32_t tmp = generate(); if(tmp > m)b++; } if(b >= itr - b)l = m + 1; else r = m + 1; prev = m; } cout << l << endl; return 0; }