def gcd(a, b):
if max(a, b) % min(a, b) == 0:
return min(a, b)
else:
return compute(min(a, b), max(a, b) % min(a, b))
def lcm(a, b):
return a * b / gcd(a, b)
def compute(a, b, c, d):
m = lcm(b, d)
c = a * (m / b) + c * (m / d)
i = gcd(m, c)
return c / i, m / i
print(compute(1, 2, 1, 6))