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>
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
using namespace std;
int main(void) {
  int m, n;
  scanf("%d%d", &m, &n);
  int t = m > n ? m : n;
  int x = 7 - t;
  int y = 6;
  if (x == 0) {
    printf("0/1\n");
    return 0;
  }
  m = gcd(x, y);
  x /= m;
  y /= m;
  printf("%d/%d\n", x, y);
  return 0;
}
