#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
  if(b!=0){
    return gcd(b,a%b);
  } else {
    return a;
  }
}
ll lcm(ll a,ll b){
  return a*b/gcd(a,b);
}
int main(){
  ll T1=0,T2=0,T3=0;cin>>T1>>T2>>T3;
  ll x=lcm(T1,lcm(T2,T3));
  vector<ll> v(3);
  v[0]=x/T1;
  v[1]=x/T2;
  v[2]=x/T3;
  sort(v.begin(),v.end());
  ll a=v[1]-v[0];
  ll b=v[2]-v[1];
  ll y=gcd(a,b);
  ll z=gcd(x,y);
  cout<<x/z<<"/"<<y/z<<endl;
}