package yukicoder356;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		long t1=sc.nextInt();
		long t2=sc.nextInt();
		long t3=sc.nextInt();
		long lcm=LCM(t1,t2,t3);
		if(t1==t2&&t2==t3){
			System.out.println(0);
			return;
		}
		long[] d={lcm/t1,lcm/t2,lcm/t3};
		Arrays.sort(d);
		for(long i=d[2]-1;i>=1;i--){
			if(d[0]%i==d[1]%i&&d[1]%i==d[2]%i){
				long aaa=GCD(lcm,i);
				System.out.println(lcm/aaa+"/"+i/aaa);
				return;
			}
		}
	}
	//最小公倍数
	public static long LCM(long t1,long t2,long t3){
		return LCM(LCM(t1,t2),t3);
	}
	public static long LCM(long t1,long t2){
		long a=GCD(t1,t2);
		long tt1=t1/a;
		long tt2=t2/a;
		return tt1*tt2*a;
	}
	public static long GCD(long t1,long t2){
		if(t1<t2){
			long d=t2;
			t2=t1;
			t1=d;
		}
		if(t2==0)return t1;
		return GCD(t2,t1%t2);
	}
}