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.Scanner;

public class CF9_D2_A
{
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner( System.in );
		int iY = scanner.nextInt();
		int iW = scanner.nextInt();
		
		int iD =0;
		
	
		if ( iY > iW	)
			iD = iY;
		else
			iD = iW;
		
		int iNumerator = 6 - iD + 1;// 1 is added , to include the case It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.
		
		int iDenominator = 6;
		
		int iHCF = gcd( iNumerator, iDenominator );
		
		//System.out.println( iHCF );
		
		System.out.println( iNumerator/iHCF + "/" + iDenominator/iHCF );
	
	}

	private static int gcd(int iNumerator, int iDenominator)
	{
		if( iDenominator == 0 )
			return iNumerator;
		else
			return gcd( iDenominator, iNumerator % iDenominator );
	}
}
