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.
import math

s = list(input())

ss = {}
for l in s: 
    ss[l] = s.count(l)

print(ss)
to_remove = 0
for l, counter in ss.items():
    to_remove += counter%2

#TODO: remove that :w
print(to_remove)
if ((len(s) % 2 != 0 and to_remove%2 != 0) or (len(s)%2 == 0 and to_remove%2 == 0)) and to_remove > 0: 
    to_remove -= 1

print(to_remove)
if to_remove % 2 == 0:
    print('First')
else:
    print('Second')
