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

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 20;
pair<int, int> points[N];
int arr[N];
int cntu[N];
int cnts[N];
int main() {
  int y, w, cnt = 0;
  cin >> y >> w;
  for (int i = 1; i <= 6; i++)
    if (i >= y && i >= w) cnt++;
  if (cnt == 0)
    cout << "0/1\n";
  else {
    int m = 6;
    for (int i = 1; i <= 6; i++) {
      if (m % i == 0 && cnt % i == 0) {
        m /= i;
        cnt /= i;
      }
    }
    cout << cnt << '/' << m << '\n';
  }
  return 0;
}
