#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
ll gcd(ll a, ll b){
    if(b==0) return a;
    return gcd(b, a%b);
}
int main()
{
    ll t1, t2, t3;
    cin>>t1>>t2>>t3;
    vector<P> v;
    for(int p=-1; p<=1; p+=2){
        for(int q=-1; q<=1; q+=2){
            ll x=t1*(t3-q*t2), y=t3*(t2-p*t1);
            ll g=gcd(x, y);
            ll a=t1*t2*y/g, b=t2-p*t1;
            ll h=gcd(a, b);
            v.push_back({a/h, b/h});
        }
    }
    P ans=*min_element(v.begin(), v.end(), [&](P x, P y){ return x.first*y.second<y.first*x.second;});
    printf("%lld/%lld\n", ans.first, ans.second);
    return 0;
}