#include<bits/stdc++.h>
 using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
LL A,B,C;
LL D,E,F,G;
vector<int>p;
bool used[10001];
/*
void prime(){
    REP(i,10001){
        if(used[i]==false){
           p.push_back(i);
           for(int j=2;i*j<10001;j++){
              used[i*j]=true;
           }
        }
    }
}
*/

//最大公約数
LL gcd(LL a,LL b){
   if(a<b){
      LL temp=a;
      a=b;
      b=temp;
   }
   if(b==0)return a;
   return(gcd(b,a%b));
}
//最小公倍数
LL koubai(LL a,LL b){
   LL g=gcd(a,b);
   LL ans=(a/g)*b;
   return ans;
}

int main(){
    REP(i,10001){
        used[i]=false;
    }
    //prime();
    cin>>A>>B>>C;
    D=A*C;
    E=C-A;
    LL X=gcd(D,E);
    D/=X;
    E/=X;
    F=B*C;
    G=C-B;
    LL Y=gcd(F,G);
    F/=Y;
    G/=Y;
    LL H=koubai(D,F);
    LL I=gcd(E,G);
    LL Z=gcd(H,I);
    H/=Z;
    I/=Z;
    cout<<H<<"/"<<I<<endl;
}