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 {
	

    public static int gcf(int num1, int num2) {
    	int gcf = 0;
    	for(int i = 1; i <= num1 && i <= num2; i++)
	    {
	        if(num1 % i == 0 && num2 % i == 0)
	        {
	        	gcf = i;
	        }
	    }
    	return gcf;
    }

	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int y,w;
		
		y = in.nextInt();
		w = in.nextInt();
		
		int greatestNum = (6 - Math.max(y, w))+ 1;
			
		System.out.println(greatestNum/DieRoll.gcf(greatestNum, 6)+"/"+6/DieRoll.gcf(greatestNum, 6));

	}

}
