import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]

from fractions import Fraction

def main():
    T1 = NI()
    T2 = NI()
    T3 = NI()
    L = T1 * T2 * T3
    V1 = L // T1
    V2 = L // T2
    V3 = L // T3
    # print(L, V1, V2, V3)
    T12 = Fraction(L, (V1+V2))
    T23 = Fraction(L, (V2+V3))
    T31 = Fraction(L, (V3+V1))
    # print(T12, T23, T31)
    nu = math.lcm(T12.numerator, T23.numerator)
    de = math.gcd(T12.denominator, T23.denominator)
    f = Fraction(nu, de)
    print(f"{f.numerator}/{f.denominator}")


if __name__ == "__main__":
    main()