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;
#pragma warning(disable : 4996)
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = 2 * acos(0.0);
int cc, bb;
char ch;
inline int F() {
  while (ch = getchar(), (ch < 48 || ch > 57) && ch != '-')
    ;
  ch == '-' ? cc = bb = 0 : (cc = ch - '0', bb = 1);
  while (ch = getchar(), ch > 47 && ch < 58)
    cc = (cc << 1) + (cc << 3) + (ch ^ 48);
  return bb ? cc : -cc;
}
void write(int x) {
  int y = 10, len = 1;
  while (y <= x) {
    y *= 10;
    len++;
  }
  while (len--) {
    y /= 10;
    putchar(x / y + 48);
    x %= y;
  }
}
int n;
long long e[2000007];
int pri[2000007], cnt;
bool noprime[2000007];
void sift(int n) {
  noprime[1] = 1;
  e[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!noprime[i]) pri[cnt++] = i, e[i] = i - 1;
    for (int j = 0; j < cnt && i * pri[j] <= n; j++) {
      noprime[i * pri[j]] = 1;
      if (i % pri[j] == 0) {
        e[i * pri[j]] = e[i] * pri[j];
        break;
      }
      e[i * pri[j]] = e[i] * e[pri[j]];
    }
  }
  for (int i = 2; i <= n; i++) e[i] += e[i - 1];
}
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
int w[100007];
void fj(long long a) {
  for (long long i = 1; i * i <= a; i++) {
    if (!(a % i)) {
      w[cnt++] = i;
      if (i * i != a) w[cnt++] = a / i;
    }
  }
}
int main() {
  int a, b;
  scanf("%d%d", &a, &b);
  int p = max(a, b);
  int n = 6 - p + 1, m = 6;
  p = gcd(n, m);
  printf("%d/%d\n", n / p, m / p);
  return 0;
}
