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

import java.util.Scanner;

public class DieRoll {
    private static final Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        int w = sc.nextInt();


        int y = sc.nextInt();

        int no2compare = y;

        if (w > y){
            no2compare = w;
        }

        int nominator = 6 - no2compare +1 ;
        int dominator = 6;

        sc.close();



        int divisor = getGCD(nominator, dominator);
        System.out.println(nominator/divisor+"/"+dominator/divisor);
    }

    public static int getGCD(int n1, int n2) {
        if (n2 == 0) {
            return n1;
        }
        return getGCD(n2, n1 % n2);
    }
}
