6 6
 1 4
 4 4
 3 3
 6 4
 6 3
 5 4
 5 6
 3 4
 1 3
 3 2
 5 5
 1 1
 2 1
 3 1
 3 5
 1 6
 6 5
 2 3
 4 3
 2 2
 3 6
 1 2
 6 1
 2 5
 4 5
 1 5
 6 2
 4 6
 5 1
 4 1
 5 2
 2 4
 2 6
 5 3

1/6
 1/2
 1/2
 2/3
 1/6
 1/6
 1/3
 1/6
 1/2
 2/3
 2/3
 1/3
 1/1
 5/6
 2/3
 1/3
 1/6
 1/6
 2/3
 1/2
 5/6
 1/6
 5/6
 1/6
 1/3
 1/3
 1/3
 1/6
 1/6
 1/3
 1/2
 1/3
 1/2
 1/6
 1/3

# https://codeforces.com/contest/9/problem/A

lst =[int(i) for i in input().split()]
max_val = 6
num_of_favours = max_val - max(lst) + 1

min_of_two = min(num_of_favours,max_val)
#fraction = num_of_favours/6
#print(fraction)

prime_number_set = [2, 3, 5]
for i in prime_number_set:
    if i <= min_of_two:
        if num_of_favours % i == 0 and max_val % i == 0:
            num_of_favours = int(num_of_favours/i)
            max_val = int(max_val/i)

print(str(num_of_favours)+'/'+str(max_val))