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

//%%%rng_58

#include<bits/stdc++.h>
using namespace std;
//define:
#define REP(i,n) for(int i = 0; i < n; i++)
//const:
const int MAXN = 40010;
//something:
int ans = 0;
int N,M,mx;
int ans1,ans2;
//input:
void scan() {
	cin >> N >> M; 
}
//output
void print() {
	cout << ans1 << '/' << ans2 << endl;
}
//run:
void solve() {
	mx = max(N,M);
	ans1 = 6 - mx + 1;
	ans2 = 6;
	ans1 = ans1 / __gcd(ans1,ans2);
	ans2 = ans2 / __gcd(ans1,ans2);
}
//times:
void Times(int T) {
	while(T--) {
		scan();
		solve();
		print();
	}
}
//begin:
int main() {
	int T;
	//cin >> T;
	T = 1;
	Times(T);
	return 0;
}