#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

struct Ratio{
  ll up,down;
};

void yakubun(Ratio &r){
  ll g = __gcd(r.up,r.down);
  r.up /= g;
  r.down /= g;
}

void osae(Ratio &r){
  r.up %= r.down;
}

int main(){
  int t1,t2,t3;
  cin>>t1>>t2>>t3;
  Ratio p = {t1,t2-t1};
  yakubun(p);
  Ratio p2 = p;
  p2.up *= t2;
  p2.down *= t3;
  yakubun(p2);
  int N = 1;
  while(true){
    Ratio a = p, b = p2;
    a.up *= N;
    b.up *= N;
    yakubun(a);
    osae(a);
    yakubun(b);
    osae(b);
    if(a.up==b.up && a.down==b.down)break;
    ++N;
  }
  Ratio ans = {N*t1*t2, t2-t1};
  yakubun(ans);
  printf("%lld/%lld\n",ans.up,ans.down);
  return 0;
}