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

//package com.company;
import java.util.*;


import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        int t =scanner.nextInt();
        int t2 = scanner.nextInt();
        int x = 6 - Math.max(t,t2) + 1;
        if(x==2){
            System.out.println(1 + "/" + 3);
        }else if(x==1){
            System.out.println(1 + "/" );
        }else if(x==3){
            System.out.println(1 + "/" + 2);
        }else if(x==4){
            System.out.println(2 + "/" + 3);

        }else if(x==5){
            System.out.println(4 + "/" + 5);
        }
    }
    private static Scanner scanner = new Scanner(System.in);
    private static int max(int[] array ){
        int min = Integer.MIN_VALUE;
        for(int i = 0;i< array.length;i++){
            if(array[i]>min){
                min = array[i];
            }
        }
        return min;
    }
    private static int min(int[] array ){
        int min = Integer.MAX_VALUE;
        for(int i = 0;i< array.length;i++){
            if(array[i]<min){
                min = array[i];
            }
        }
        return min;
    }
    private static void readArray(int[] array){
        for(int i = 0;i< array.length;i++){
            array[i] = scanner.nextInt();
        }
    }
    private static void printarray(int[] array){
        for(int i = 0; i< array.length;i++){
            System.out.print(array[i]);
        }
    }
    private static int gcd(int a , int b){
        int k = 0;
        for(int i  =1 ;i<Math.max(a,b);i++){
            if(a%i==0 && b%i==0){
                k = i;
            }
        }
        return k;
    }
    private static int fact(int n){
        if(n==1){
            return 1;
        }
        else {
            return n*fact(n-1);
        }
    }
}