




import math

def      lowerCAmelCase_     (					lowerCamelCase:    int  )   ->     bool:


      '''simple docstring'''




      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(SCREAMING_SNAKE_CASE_  ) + 1  )       ,			6  ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True

def      lowerCAmelCase_     (					lowerCamelCase:    int = 2_00_00_00  )   ->     int:


      '''simple docstring'''




      return sum(num for num in range(3       ,			SCREAMING_SNAKE_CASE_       ,			2  ) if is_prime(SCREAMING_SNAKE_CASE_  )  ) + 2 if n > 2 else 0


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





def      lowerCAmelCase_     (					lowerCamelCase:    Optional[int]  )   ->     Union[str, Any]:


      '''simple docstring'''




      lowerCamelCase__ 					=			[7_01, 3_01, 1_32, 57, 23, 10, 4, 1]
      for gap in gaps:
            for i in range(lowerCamelCase       ,			len(lowerCamelCase  )  ):
                  lowerCamelCase__ 					=			collection[i]
                  lowerCamelCase__ 					=			i
                  while j >= gap and collection[j - gap] > insert_value:
                        lowerCamelCase__ 					=			collection[j - gap]
                        j -= gap
                  if j != i:
                        lowerCamelCase__ 					=			insert_value
      return collection


if __name__ == "__main__":
      from doctest import testmod

      testmod()
      __SCREAMING_SNAKE_CASE      :				List[Any]				      =input("""Enter numbers separated by a comma:\n""").strip()
      __SCREAMING_SNAKE_CASE      :				Dict				      =[int(item) for item in user_input.split(""",""")]
      print(shell_sort(unsorted))