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.*;
import java.math.*;
import java.io.*;
public class ShortestPath {
//begin of the template--------------------------- 
    public static void main (String [] args) throws IOException {
        new ShortestPath().run();
    }
    StreamTokenizer in;
    PrintWriter out;
    int nextInt () throws IOException {
        in.nextToken();
        return (int)in.nval;
    }
    void run () throws IOException {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(new OutputStreamWriter(System.out));
        solve();
        out.flush();
    }
    int gcd(int a, int b) {
        if(b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }
    void solve () throws IOException {
        int y = nextInt();
        int w = nextInt();
        int s = Math.max(y, w);
        int res[] = {1, 2, 3, 4, 5, 6};
        int cnt = 0;
        int A, B;
        for(int i = 0; i < 6; ++i) {
            if(res[i] >= s) {
                cnt++;
            }
        }
        A = cnt;
        B = 6;
        int d = gcd(A, B);
        A /= d;
        B /= d;
        System.out.printf("%d/%d", A, B);
    }
//end of the template---------------------------
}
