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

l=input().split()
x, y = int(l[0]), int(l[1])
k=max(x, y)

def eucledean(n, m):
    if m>n:
       t=m
       m=n
       n=t
    while m>0:
        i=n
        n=m
        m=i%m
    return n

numerator = 6-k+1#6-(k-1)
gcd = eucledean(numerator, 6)
st='%s/%s'
print(st % (numerator //gcd, 6//gcd))
