#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    vector<ll> T(3);
    for (int i = 0; i < 3; i++) {
        cin >> T[i];
    }
    ll D = T[0] * T[1] * T[2];
    pair<long, long> ans{D, 1ll};
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            ll N1 = T[1] * (T[2] + T[0] * (i ? 1 : -1));
            ll N2 = T[0] * (T[2] + T[1] * (j ? 1 : -1));
            pair<long, long> now{D, gcd(N1, N2)};
            ll tmp = gcd(now.first, now.second);
            now.first /= tmp;
            now.second /= tmp;
            if (ans.first * now.second > ans.second * now.first)
                ans = now;
        }
    }

    cout << ans.first << "/" << ans.second << endl;
}