#include <iostream>
using namespace std ;
int gcd ( int n , int m ) {
	if ( n < m ) swap ( n , m ) ;
	if ( n%m == 0 ) return m ;
	gcd ( m , n%m ) ;
}
int main () {
	int a , b , c ;
	cin >> a >> b >> c ;
	int maxn = max ( max ( a , b ) , c ) , minn = min ( min ( a , b ) , c ) ;
	int gcdn = gcd ( maxn , minn ) ;
	cout << minn/gcdn << '/' << maxn/gcdn ;
	return 0 ;
}

C++14上运行没问题，可一道洛谷就听取RE一片 有无神犇？求调！