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

# 9-A-DieRoll.py

import math

def computeGCD(a, b):

    if b == 0:
        return a

    return computeGCD(b, a%b)

def createFraction(goodCases, totalCases):

    if goodCases == 0:
        return "0/1"

    elif goodCases == totalCases:
        return "1/1"

    a = goodCases
    b = totalCases
    gcdAB = computeGCD(a, b)

    return str(a//gcdAB) + "/" + str(b//gcdAB)

Y, W = [int(x) for x in input().split()]
goodCases = (6 - max(Y, W)) + 1
totalCases = 6
print(createFraction(goodCases, totalCases))