#include<cstdio>
int gcd(int m, int n)//辗转相除法求最大公约数
{
	int rem;
	if (n > 0)
	{
		rem = m % n;
		m = n;
		n = rem;
	}
	return m;//最大公约数
}
int main()
{
	int a, b, c, g, max = 0, min = 0;
	scanf("%d%d%d", &a, &b, &c);
	max = a > max ? a : max;
	max = b > max ? b : max;
	max = c > max ? c : max;
	if (max == a)
	{
		min = b < c ? b : c;
		g = gcd(min, max);
		printf("%d/%d", min/g,max/g);
	}
	else if (max == b)
	{
		min = a < c ? a : c;
		g = gcd(min, max);
		printf("%d/%d", min / g, max / g);
	}
	else
	{
		min = a < b ? a : b;
		g = gcd(min, max);
		printf("%d/%d", min / g, max / g);
	}
	return 0;
}