/*
  0 <= a <= 1/2
  t / T_i = n_i + a
  t / T_i = n_i - a
  
  t / T_i + t / T_j in Z
  or
  t / T_i - t / T_j in Z
  
  (a / b) (p / q) in Z
  <=> b q | a p
  <=> b | p && q | q
*/

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long lcm(long a, long b) {
  return a / gcd(a, b) * b;
}

long T1, T2, T3;

void main() {
  try {
    for (; ; ) {
      T1 = readLong();
      T2 = readLong();
      T3 = readLong();
      
      long ansP = 1, ansQ = 0;
      foreach (s; 0 .. 8) {
        long a12 = (s & 1) ? (T2 + T1) : (T2 - T1);
        long a13 = (s & 2) ? (T3 + T1) : (T3 - T1);
        long b12 = T1 * T2;
        long b13 = T1 * T3;
        long g;
        g = gcd(a12, b12); a12 /= g; b12 /= g;
        g = gcd(a13, b13); a13 /= g; b13 /= g;
        const p = lcm(b12, b13);
        const q = gcd(a12, a13);
        if (ansP * q > p * ansQ) {
          ansP = p;
          ansQ = q;
        }
      }
      writeln(ansP, "/", ansQ);
    }
  } catch (EOFException e) {
  }
}