You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
entrada = input()
entrada = list(map(int, entrada.split()))
total = 0
for a in entrada:
  total += a
repetidos2 = []
repetidos3 = []
novo = []

for a in entrada:
  if a in novo:
    if a in repetidos2:
      repetidos3.append(a)
    else:
      repetidos2.append(a)
  novo.append(a)
  
maior = total

for rep in repetidos2:
  if(total - 2*rep < maior):
     maior = total - 2*rep

for rep in repetidos3:
  if(total - 3*rep < maior):
     maior = total - 3*rep

print(maior)