#include using namespace std;

// 计算最大公约数 int gcd(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; }

int main() { int a, b, c, d; cin >> a >> b >> c >> d;

// 计算和的分子和分母
int numerator = a * d + c * b;
int denominator = b * d;

// 约分
int common = gcd(numerator, denominator);
numerator /= common;
denominator /= common;

// 输出结果
cout << a << "/" << b << "+" << c << "/" << d << "=";
if (numerator >= denominator) {
    int integer = numerator / denominator;
    numerator = numerator % denominator;
    cout << integer;
    if (numerator != 0) {
        cout << "+" << numerator << "/" << denominator;
    }
} else {
    cout << numerator << "/" << denominator;
}

return 0;

}