#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int a,b,c;
	cin >> a >> b >> c;
	int tmpa = a, tmpb = b, tmpc = c;
	while(1) {
		if(tmpa == tmpb && tmpa == tmpc) break;
		int m = min(tmpa, min(tmpb, tmpc));
		if(m == tmpa) {
			tmpa += a;
		} else if(m == tmpb) {
			tmpb += b;
		} else if(m == tmpc) {
			tmpc += c;
		}
	}
	int lcm = tmpa;
	double aa = (double)tmpa/a, bb = (double)tmpb/b, cc = (double)tmpc/c;

	int num = 2, ans2 = 1;
	while(aa / num > 1) {
		double tmp1 = aa / num, tmp2 = bb / num, tmp3 = cc / num;
		tmp1 -= (int)tmp1;
		tmp2 -= (int)tmp2;
		tmp3 -= (int)tmp3;
		tmp1 = floor(tmp1*10000) / 10000;
		tmp2 = floor(tmp2*10000) / 10000;
		tmp3 = floor(tmp3*10000) / 10000;
		// printf("%.20f %.20f %.20f\n", tmp1, tmp2, tmp3);
		// cout << tmp1 << " " << tmp2 << " " << tmp3 << endl;
		if(tmp1 == tmp2 && tmp1 == tmp3) ans2 = num;
		num++;
	}

	cout <<	lcm << "/" << ans2 << endl;

	return 0;
}