#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int main(void) {
    ll a, b, c;
    cin >> a >> b >> c;
    ll mx = 1;
    mx = max(mx,__gcd(c * (b - a), a * (c - b)));
    mx = max(mx,__gcd(c * (b + a), a * (c - b)));
    mx = max(mx,__gcd(c * (b - a), a * (c + b)));
    mx = max(mx,__gcd(c * (b + a), a * (c + b)));
    ll x = __gcd(mx,a * b * c);
    cout << a * b * c / x << "/" << mx / x << endl;
    return 0;
}