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.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class javacode {
	public static void main(String args[]) {
		
		ArrayList<Integer> list = new ArrayList<Integer>();
		list.addAll(Arrays.asList(new Integer[] {1,2,3,4,5,6}));
		
		Scanner sc= new Scanner(System.in);
		int x = sc.nextInt();
		int y = sc.nextInt();
		int Maximum = Math.max(x, y);
		int prop = list.size()-list.indexOf(Maximum)-1;
				if(prop==0)
					System.out.println("0/1");
				else if(prop==1)
					System.out.println("1/4");
				else if(prop==2)
					 System.out.println("1/2");
				else if(prop==3)
						System.out.println("3/4");
				else if(prop==4)
					    System.out.println("1/1");
	}
}
