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

// Codeforces 9A - Die Roll

import java.io.*;
import java.util.*;

public class DieRoll {
	public static void main(String[] args) {
		FastScanner fs = new FastScanner(System.in);
		int y = fs.nextInt();
		int w = fs.nextInt();
		int num = 6 - Math.max(y , w) + 1;
		int denom = 6;
		// Reduce
		int i = 2;
		while (i <= num) {
			if (num % i == 0 && denom % i == 0) {
				num /= i;
				denom /= i;
			}
			++i;
		}
		System.out.printf("%s/%s", num, denom);
	}
	
	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;
		
		FastScanner(InputStream s) {
			try {
				br = new BufferedReader(new InputStreamReader(s));
			}
			catch (Exception e) {
				e.printStackTrace();
			}
		}
		
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				}
				catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
	}
}