/* -*- coding: utf-8 -*-
 *
 * 229.cc: No.229 線分上を往復する3つの動点の一致 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;
typedef pair<ll,ll> pll;

/* global variables */

/* subroutines */

pll calc_t(int t1, int t2, int t3, int s0, int s1) {
  int num0 = t3 + s0 * t1, den0 = t1 * t3;
  int g0 = __gcd(num0, den0);
  num0 /= g0, den0 /= g0;

  int num1 = t3 + s1 * t2, den1 = t2 * t3;
  int g1 = __gcd(num1, den1);
  num1 /= g1, den1 /= g1;

  int gd = __gcd(den0, den1);
  ll den = (ll)den0 * den1 / gd;
  ll num = __gcd((ll)num0 * den1 / gd, (ll)num1 * den0 / gd);

  return pll(den, num);
}

/* main */

int main() {
  int t1, t2, t3;
  cin >> t1 >> t2 >> t3;

  pll a0 = calc_t(t1, t2, t3, -1, -1);
  pll a1 = calc_t(t1, t2, t3,  1, -1);
  pll a2 = calc_t(t1, t2, t3, -1,  1);
  pll a3 = calc_t(t1, t2, t3,  1,  1);

  ll maxd = a0.second;
  if (maxd < a1.second) maxd = a1.second;
  if (maxd < a2.second) maxd = a2.second;
  if (maxd < a3.second) maxd = a3.second;

  printf("%lld/%lld\n", a0.first, maxd);
  return 0;
}