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;
import java.util.StringTokenizer;

public class dieroll {

    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	String input = sc.nextLine();
	StringTokenizer st = new StringTokenizer(input);
	int x = Integer.parseInt(st.nextToken());
	int y = Integer.parseInt(st.nextToken());

	int compare = Integer.max(x, y);
	int possible = 6 - compare + 1;
	System.out.println(asFraction(possible, 6));
    }

    public static long gcm(long a, long b) {
	return b == 0 ? a : gcm(b, a % b); // Not bad for one line of code :)
    }

    public static String asFraction(long a, long b) {
	long gcm = gcm(a, b);
	return (a / gcm) + "/" + (b / gcm);
    }

}
