#include<iostream>
#include<algorithm>

using namespace std;

long long gcd(long long a,long long b){
	if(a<b) return gcd(b,a);
	if(b!=0) return gcd(b,a%b);
	return a;
}

int main(){

	long long T1,T2,T3;
	long long ans1,ans2;

	cin>>T1>>T2>>T3;

	long long N=gcd(T1,T2);
	long long A=T1*T2/N;
	N=gcd(A,T3);
	A=A*T3/N;

	ans1=A;

	long long K1=A/T1;
	long long K2=A/T2;
	long long K3=A/T3;

	for(long long i=max(max(K1,K2),K3);i>=1;i--){
		if(K1%i==K2%i&&K2%i==K3%i){
			ans2=i;
			break;
		}
	}

	for(long long i=2;i<min(ans1,ans2);i++){
		if(ans1%i==0&&ans2%i==0){
			ans1/=i;
			ans2/=i;
			i--;
		}
	}
	cout<<ans1<<"/"<<ans2<<endl;
}