#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

uint32_t x = 0, y = 1, z = 2, w = 3;
int64_t seed;
uint32_t generate() { 
    uint32_t t = (x^(x<<11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
    return (ll)w;
}

ll counting(ll t) {
    x = seed, y = 1, z = 2, w = 3;
    ll res = 0;
    rep(i, 0, 10000001) if (generate() <= t) res++;
    return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> seed; 
    x = seed;
    ll l = 0, r = 1e10+1LL;
    while (r - l != 1) {
        ll mid = (r + l) / 2;
        if (5000001 <= counting(mid)) r = mid;
        else l = mid;
    }
    cout << r << endl;
    return 0;
}