


import math




def  a   (lowerCAmelCase__   ):

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5		,				int(math.sqrt(lowerCAmelCase__   ) + 1   )		,				6   ):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True




def  a   (lowerCAmelCase__ = 10_001   ):

   try:
      __a					=  int(lowerCAmelCase__   )
   except (TypeError, ValueError):
      raise TypeError("""Parameter nth must be int or castable to int."""   ) from None
   if nth <= 0:
      raise ValueError("""Parameter nth must be greater than or equal to one."""   )
   __a					=  []
   __a					=  2
   while len(lowerCAmelCase__   ) < nth:
      if is_prime(lowerCAmelCase__   ):
         primes.append(lowerCAmelCase__   )
         num += 1
      else:
         num += 1
   return primes[len(lowerCAmelCase__   ) - 1]


if __name__ == "__main__":
  print(f'''{solution() = }''')







def  a   (lowerCAmelCase__ = 1_000_000   ):
   __a					=  1
   __a					=  1
   __a					=  {1: 1}

   for inputa in range(2		,				lowerCAmelCase__   ):
      __a					=  0
      __a					=  inputa

      while True:
         if number in counters:
            counter += counters[number]
            break
         if number % 2 == 0:
            number //= 2
            counter += 1
         else:
            __a					=  (3 * number) + 1
            counter += 1

      if inputa not in counters:
         __a					=  counter

      if counter > pre_counter:
         __a					=  inputa
         __a					=  counter
   return largest_number


if __name__ == "__main__":
  print(solution(int(input().strip())))



