#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
const int maxn = 100010;
struct num{long long k = 0;long long up;long long down;
};
int gcd(long long a, long long b){return b == 0 ? a : gcd(b, a % b);
}
num add(num n1, num n2){num res;res.down = n1.down*n2.down;res.up = n1.down*n2.up + n1.up*n2.down;return res;
}
num sub(num n1, num n2){num res;res.down = n1.down*n2.down;res.up = n2.down*n1.up - n2.up*n1.down;return res;
}
num mul(num n1, num n2){num res;res.down = n1.down*n2.down;res.up = n1.up*n2.up;return res;
}
num dive(num n1, num n2){num res;res.down = n1.down*n2.up;res.up = n1.up*n2.down;if (res.down < 0){res.down = -1 * res.down;res.up = -1 * res.up;}return res;
}
void clean(num n){int flag = 0;n.k = n.up / n.down;if (n.up < 0){n.up = -n.up; flag = 1;}n.up = n.up%n.down;int g = abs(gcd(n.up, n.down));n.up /= g;n.down /= g;if (flag == 1){printf("(");}if (n.k != 0){printf("%lld", n.k);if (n.up != 0){printf(" %lld/%lld", n.up, n.down);}}else{if (n.up != 0){if (flag == 1)printf("-");printf("%lld/%lld", n.up, n.down);}else{printf("0");}}if (flag == 1){printf(")");}}
int main(){num n1, n2;scanf("%lld/%lld %lld/%lld", &n1.up, &n1.down, &n2.up, &n2.down);/*int g = abs(gcd(n1.up, n1.down));n1.up /= g;n1.down /= g;g = abs(gcd(n2.up, n2.down));n2.up /= g;n2.down /= g;*/num q, w, e, r;q = add(n1, n2);clean(n1);printf(" + ");clean(n2);printf(" = ");clean(q);printf("\n");w = sub(n1, n2);clean(n1);printf(" - ");clean(n2);printf(" = ");clean(w);printf("\n");r = mul(n1, n2);clean(n1);printf(" * ");clean(n2);printf(" = ");clean(r);printf("\n");if (n2.up != 0){e = dive(n1, n2);clean(n1);printf(" / ");clean(n2);printf(" = ");clean(e);printf("\n");}else{clean(n1);printf(" / ");clean(n2);printf(" = Inf\n");}system("pause");
}