


def   _UpperCamelCase				(						lowerCAmelCase_ = 2_0_0_0_0_0_0   )						->int:
   UpperCAmelCase							=     [0 for i in range(n + 1   )]
   UpperCAmelCase							=     1
   UpperCAmelCase							=     1

   for i in range(2  ,						int(n**0.5   ) + 1   ):
      if primality_list[i] == 0:
         for j in range(i * i  ,						n + 1  ,						lowerCAmelCase_   ):
            UpperCAmelCase							=     1
   UpperCAmelCase							=     0
   for i in range(lowerCAmelCase_   ):
      if primality_list[i] == 0:
         sum_of_primes += i
   return sum_of_primes


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







from __future__ import annotations
def   _UpperCamelCase				(						lowerCAmelCase_   )						->None:
   create_state_space_tree(lowerCAmelCase_  ,						[]  ,						0  ,						[0 for i in range(len(lowerCAmelCase_   )   )]   )
def   _UpperCamelCase				(						lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_  ,						)						->None:

   if index == len(lowerCAmelCase_   ):
      print(lowerCAmelCase_   )
      return

   for i in range(len(lowerCAmelCase_   )   ):
      if not index_used[i]:
         current_sequence.append(sequence[i]   )
         UpperCAmelCase							=     True
         create_state_space_tree(lowerCAmelCase_  ,						lowerCAmelCase_  ,						index + 1  ,						lowerCAmelCase_   )
         current_sequence.pop()
         UpperCAmelCase							=     False
__a     =			[3, 1, 2, 4]
generate_all_permutations(sequence)

__a     =			["A", "B", "C"]







generate_all_permutations(sequence_a)



