


def 	lowerCAmelCase       (						lowerCAmelCase_       )->       float:
				lowerCAmelCase_       :					Optional[Any]			 = 0
				while len(a_       ) > 1:
								lowerCAmelCase_       :					List[str]			 = 0
								# Consider two files with minimum cost to be merged
								for _ in range(2       ):
												lowerCAmelCase_       :					Optional[int]			 = files.index(min(a_       )       )
												temp += files[min_index]
												files.pop(a_       )
								files.append(a_       )
								optimal_merge_cost += temp
				return optimal_merge_cost


if __name__ == "__main__":
						import doctest

						doctest.testmod()






"""simple docstring"""
def      __lowerCamelCase   (							a_     :		Union[str, Any]							)			->      Optional[int]:
      __SCREAMING_SNAKE_CASE   :List[str]						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  2
      while i * i <= n:
            __SCREAMING_SNAKE_CASE   :Tuple						=  0
            while n % i == 0:
                  n //= i
                  multiplicity += 1
            n_divisors *= multiplicity + 1
            i += 1
      if n > 1:
            n_divisors *= 2
      return n_divisors



def      __lowerCamelCase   (							)			->      int:
      __SCREAMING_SNAKE_CASE   :Dict						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  1

      while True:
            i += 1
            t_num += i

            if count_divisors(a_							) > 5_00:
                  break

      return t_num


if __name__ == "__main__":
  print(solution())