


def    lowercase_	(	_A    :					Optional[Any]		):

						"""simple docstring"""




						if num <= 0:
												raise ValueError("Input must be a positive integer"		)

						lowerCamelCase__	:       str					=						[True] * (num + 1)

						lowerCamelCase__	:       Any					=						2
						while p * p <= num:
												if primes[p]:
																		for i in range(p * p					,      num + 1					,      __lowerCAmelCase		):
																								lowerCamelCase__	:       List[str]					=						False
												p += 1

						return [prime for prime in range(2					,      num + 1		) if primes[prime]]


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				A   :					Optional[int]	=      int(input("Enter a positive integer: ").strip())
				print(prime_sieve_eratosthenes(user_num))






import os

def    lowercase_	(	_A    :					str = "input.txt"		):

      """simple docstring"""




      with open(os.path.join(os.path.dirname(_A		)					,      _A		)		) as input_file:
            lowerCamelCase__	:       List[Any]					=						[
                [int(_A		) for element in line.split(","		)]
                for line in input_file.readlines()
            ]

      lowerCamelCase__	:       Optional[Any]					=						len(_A		)
      lowerCamelCase__	:       Union[str, Any]					=						len(matrix[0]		)

      lowerCamelCase__	:       Union[str, Any]					=						[[-1 for _ in range(_A		)] for _ in range(_A		)]
      for i in range(_A		):
            lowerCamelCase__	:       Optional[Any]					=						matrix[i][0]

      for j in range(1					,      _A		):
            for i in range(_A		):
                  lowerCamelCase__	:       int					=						minimal_path_sums[i][j - 1] + matrix[i][j]

            for i in range(1					,      _A		):
                  lowerCamelCase__	:       Tuple					=						min(
                      minimal_path_sums[i][j]					,      minimal_path_sums[i - 1][j] + matrix[i][j]		)

            for i in range(rows - 2					,      -1					,      -1		):
                  lowerCamelCase__	:       str					=						min(
                      minimal_path_sums[i][j]					,      minimal_path_sums[i + 1][j] + matrix[i][j]		)

      return min(minimal_path_sums_row[-1] for minimal_path_sums_row in minimal_path_sums		)


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


