using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Runtime.Remoting.Contexts;

namespace Contest
{
    class Scanner
    {
        private string[] line = new string[0];
        private int index = 0;

        public string Next()
        {
            if (line.Length <= index)
            {
                line = Console.ReadLine().Split(' ');
                index = 0;
            }

            var res = line[index];
            index++;
            return res;
        }

        public int NextInt()
        {
            return int.Parse(Next());
        }

        public long NextLong()
        {
            return long.Parse(Next());
        }

        public string[] Array()
        {
            line = Console.ReadLine().Split(' ');
            index = line.Length;
            return line;
        }

        public int[] IntArray()
        {
            var array = Array();
            var result = new int[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = int.Parse(array[i]);
            }

            return result;
        }

        public long[] LongArray()
        {
            var array = Array();
            var result = new long[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = long.Parse(array[i]);
            }

            return result;
        }

        public uint NextUint()
        {
            return uint.Parse(Next());
        }
    }

    class Program
    {
        private uint Seed;
        private uint x = 0, y = 1, z = 2, w = 3;
        private void Scan()
        {
            var sc = new Scanner();
            Seed = sc.NextUint();

        }

        uint Generate()
        {
            uint t = (x ^ (x << 11));
            x = y;
            y = z;
            z = w;
            w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
            return w;

        }


        public void Solve()
        {
            Scan();
            x = Seed;
            int length = 10000001;
            uint min = int.MaxValue - 50000000;
            uint max = (uint)int.MaxValue + 50000000;
            int Cnt = 0;
            List<uint> l = new List<uint>();
            for (int i = 0; i < length; i++)
            {
                var u = Generate();
                if (max < u) continue;
                if (min > u)
                {
                    Cnt++;
                }
                else
                {
                    l.Add(u);
                }
            }
            l.Sort();
            Console.WriteLine(l[length / 2 - Cnt]);
        }

        static void Main() => new Program().Solve();
    }

}