



def 						UpperCamelCase      (  snake_case__			:       list      )      ->	float:
   UpperCamelCase       :    Tuple		      =      0
   while len(snake_case_      ) > 1:
      UpperCamelCase       :    List[Any]		      =      0
      # Consider two files with minimum cost to be merged
      for _ in range(2      ):
         UpperCamelCase       :    Dict		      =      files.index(min(snake_case_      )      )
         temp += files[min_index]
         files.pop(snake_case_      )
      files.append(snake_case_      )
      optimal_merge_cost += temp
   return optimal_merge_cost


if __name__ == "__main__":
    import doctest

    doctest.testmod()










"""simple docstring"""



def 						__lowercase	(  snake_case_    :    int = 2000000		)  ->int:



    '''simple docstring'''







    __A       :		List[Any]							=	[0 for i in range(n + 1		)]
    __A       :		str							=	1
    __A       :		Dict							=	1

    for i in range(2							,int(n**0.5		) + 1		):
        if primality_list[i] == 0:
            for j in range(i * i							,n + 1							,snake_case_		):
                __A       :		List[Any]							=	1
    __A       :		Union[str, Any]							=	0
    for i in range(snake_case_		):
        if primality_list[i] == 0:
            sum_of_primes += i
    return sum_of_primes


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




