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

###
 # Author         : Dipu Kumar Mohanto
 #                  CSE, BRUR.
 # Problem        :
 # Category       :
 # Algorithm      :
 #
 # OJ             :
 #
 # Verdict        :
 #
 # Date           :
 #
 # E-mail         : dipukumarmohanto1@gmail.com
###
def READ():
	return map(int, input().split());

def gcd(a,b):
	while (b is not 0):
		a %= b;
		a ^= b;
		b ^= a;
		a ^= b;
	return a;

y, w = READ();
MAX = max(y, w);
P = 6 - MAX + 1;
X = gcd(6,P);

n = int(P/X);
d = int(6/X);

print("{}/{}".format(n, d));
 		 	   		 		   		 				 				  	