#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int(i)=0;(i)<(n);++(i))
#define in(T,V) T V;cin>>V;

ll gcd(ll n, ll m){return m?gcd(m,n%m):n;}
ll lcm(ll n, ll m){return n/gcd(n,m)*m;}

bool eq(ll n1, ll d1, ll n2, ll d2){
    n1 %= d1, n2 %= d2;
    return(d1*n2 == d2*n1);
}

int main(){
    in(ll,T1);  // v1 = 1/T1
    in(ll,T2);  // v2 = 1/T2
    in(ll,T3);  // v3 = 1/T3

    ll num = T1*T2;
    ll den = abs(T1-T2);

    ll g = gcd(num,den);
    num /= g, den /= g;

    for(int i = 1; ; i++){
        ll n = num * i;
        ll d2 = den * T2;
        ll d3 = den * T3;
        if(eq(n,d2,n,d3)){
            ll g = gcd(n,den);
            printf("%lld/%lld\n", n/g, den/g);
            break;
        }
    }
}