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 debug = 1;
const double PI = acos(-1.);
int min(int a, int b) { return (a > b ? b : a); }
int max(int a, int b) { return (a > b ? a : b); }
int abs(int a) { return (a < 0 ? -a : a); }
void sort(int a[], int l, int r);
int main() {
  int a, b, c;
  cin >> a >> b;
  if (a < b) a = b;
  switch (a) {
    case 1:
      cout << "1/1" << endl;
      break;
    case 2:
      cout << "5/6" << endl;
      break;
    case 3:
      cout << "2/3" << endl;
      break;
    case 4:
      cout << "1/2" << endl;
      break;
    case 5:
      cout << "1/3" << endl;
      break;
    case 6:
      cout << "1/6" << endl;
      break;
  }
  return 0;
}
void sort(int a[], int l, int r) {
  int i = l, j = r;
  int x, tmp;
  x = a[(l + r) / 2];
  while (i < j) {
    while (a[i] < x) i++;
    while (a[j] > x) j--;
    if (i <= j) {
      tmp = a[i];
      a[i] = a[j];
      a[j] = tmp;
      i++;
      j--;
    }
  }
  if (j > l) sort(a, l, j);
  if (r > i) sort(a, i, r);
}
