



"""simple docstring"""


from math import ceil

def  _lowerCAmelCase      (   lowercase_ = 1001						):
						UpperCAmelCase             = 1

						for i in range(1		,	int(ceil(n / 2.0						)						)						):
												UpperCAmelCase             = 2 * i + 1
												UpperCAmelCase             = 2 * i
												UpperCAmelCase             = total + 4 * odd**2 - 6 * even

						return total


if __name__ == "__main__":
				import sys

				if len(sys.argv) == 1:
								print(solution())
				else:
								try:
												snake_case_				     =       int(sys.argv[1])
												print(solution(n))
								except ValueError:
												print("""Invalid entry - please enter a number""")












import math







def  _SCREAMING_SNAKE_CASE				(   a  )      ->      list[int]:
					__A	:						List[str]       =				[]
					__A	:						Any       =				2
					__A	:						Union[str, Any]       =				int(math.sqrt(a  )  )  # Size of every segment
					__A	:						Any       =				[True] * (end + 1)
					__A	:						List[Any]       =				[]

					while start <= end:
										if temp[start] is True:
															in_prime.append(a  )
															for i in range(start * start					,						end + 1					,						a  ):
																				__A	:						Optional[int]       =				False
										start += 1
					prime += in_prime

					__A	:						Any       =				end + 1
					__A	:						Any       =				min(2 * end					,						a  )

					while low <= n:
										__A	:						List[Any]       =				[True] * (high - low + 1)
										for each in in_prime:
															__A	:						List[str]       =				math.floor(low / each  ) * each
															if t < low:
																				t += each

															for j in range(a					,						high + 1					,						a  ):
																				__A	:						Optional[int]       =				False

										for j in range(len(a  )  ):
															if temp[j] is True:
																				prime.append(j + low  )

										__A	:						Optional[int]       =				high + 1
										__A	:						Tuple       =				min(high + end					,						a  )

					return prime




print(sieve(10**6))




