import std.algorithm; import std.array; import std.ascii; import std.container; import std.conv; import std.math; import std.numeric; import std.range; import std.stdio; import std.string; import std.typecons; void log(A...)(A arg) { stderr.writeln(arg); } int size(T)(in T s) { return cast(int)s.length; } //long gcd(long a, long b) { // if (a < b) swap(a, b); // if (a % b == 0) return b; // return gcd(b, a % b); //} long lcm(long a, long b) { return a / gcd(a, b) * b; } void main() { auto T = new long[3]; foreach (i; 0 .. 3) { T[i] = readln.chomp.to!long; } long l = reduce!((a, b) => lcm(a, b))(1L, T); auto v = T.map!((a) => l / a).array; real ans = 1e50; long ans_n, ans_m; for (int bit = 0; bit < 8; bit++) { long[] x; for (int i = 0; i < 3; i++) { if (bit & (1 << i)) { x ~= abs(v[i] - v[(i + 1) % 3]); } else { x ~= v[i] + v[(i + 1) % 3]; } } auto g = gcd(x[0], gcd(x[1], x[2])); auto y = x.map!((a) => a / g).array; auto k = y[0]; //log(x, " k: ", k); auto c = 1.0 * l * k / x[0]; if (ans > c) { ans = c; auto p = lcm(gcd(l, x[0]), gcd(k, x[0])); //auto p = gcd(l * k, x[0]); ans_n = l / gcd(l, x[0]) * k / gcd(k, x[0]) * gcd(l, gcd(k, x[0])); ans_m = x[0] / p; } } writefln("%s/%s", ans_n, ans_m); }