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.math.BigInteger;
import java.util.Scanner;

public class ReverseNumber {
    public static void main(final String[] args) {
        Scanner sc = new Scanner(System.in);
        int total = 6;
        int x = sc.nextInt();
        int y = sc.nextInt();
        int count = 0;
        if (x >= y) {
            count = total - x + 1;         
        } else {
            count = total - y + 1;
        }
        
        int e = gcd(count, total);
        count /= e;
        total /= e;
        System.out.println(count + "/" + total);
    }

    static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        } 
            return gcd(y, x%y);
    }
}
