


'''simple docstring'''


import sys

__magic_name__			=      (
    '73167176531330624919225119674426574742355349194934'
    '96983520312774506326239578318016984801869478851843'
    '85861560789112949495459501737958331952853208805511'
    '12540698747158523863050715693290963295227443043557'
    '66896648950445244523161731856403098711121722383113'
    '62229893423380308135336276614282806444486645238749'
    '30358907296290491560440772390713810515859307960866'
    '70172427121883998797908792274921901699720888093776'
    '65727333001053367881220235421809751254540594752243'
    '52584907711670556013604839586446706324415722155397'
    '53697817977846174064955149290862569321978468622482'
    '83972241375657056057490261407972968652414535100474'
    '82166370484403199890008895243450658541227588666881'
    '16427171479924442928230863465674813919123162824586'
    '17866458359124566529476545682848912883142607690042'
    '24219022671055626321111109370544217506941658960408'
    '07198403850962455444362981230987879927244284909188'
    '84580156166097919133875499200524063689912560717606'
    '05886116467109405077541002256983155200055935729725'
    '71636269561882670428252483600823257530420752963450'
)




def      lowerCamelCase					(      lowerCamelCase  :      str):
      A_						:  int          =				1
      for digit in s:
            product *= int(lowerCamelCase)
      return product




def      lowerCamelCase					(      lowerCamelCase  :      str = N):
      A_						:  Optional[int]          =				-sys.maxsize - 1
      A_						:  Any          =				n[:13]
      A_						:  Union[str, Any]          =				13
      while cur_index < len(lowerCamelCase) - 13:
            if int(n[cur_index]) >= int(substr[0]):
                  A_						:  Optional[Any]          =				substr[1:] + n[cur_index]
                  cur_index += 1
            else:
                  A_						:  Dict          =				max(lowerCamelCase							,						str_eval(lowerCamelCase))
                  A_						:  Dict          =				n[cur_index : cur_index + 13]
                  cur_index += 13
      return largest_product


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




'''simple docstring'''


from __future__ import annotations

import math




def      lowerCamelCase					(      lowerCamelCase  :      int):

      if num <= 0:
            A_						:  List[Any]          =				F'{num}: Invalid input, please enter a positive integer.'
            raise ValueError(lowerCamelCase)

      A_						:  str          =				[True] * (num + 1)
      A_						:  Tuple          =				[]
      A_						:  str          =				2
      A_						:  Any          =				int(math.sqrt(lowerCamelCase))

      while start <= end:
            # If start is a prime
            if sieve[start] is True:
                  prime.append(lowerCamelCase)

                  # Set multiples of start be False
                  for i in range(start * start							,						num + 1							,						lowerCamelCase):
                        if sieve[i] is True:
                              A_						:  Union[str, Any]          =				False

            start += 1

      for j in range(end + 1							,						num + 1):
            if sieve[j] is True:
                  prime.append(lowerCamelCase)

      return prime


if __name__ == "__main__":
     print(prime_sieve(int(input('Enter a positive integer: ').strip())))
