#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <map>
using namespace std;
#define INF 0x3f3f3f3f
int GCD(int aa, int bb)
{
int A=aa,B=bb;
int a=1;
if(A!=0)
{
int temp;
if(A>B)
{
temp=B;
B=A;
A=temp;
}
while(A!=0)
{
a=B%A;
B=A;
A=a;
}
}
return aa*bb/B;
}
void gcd(int &num,int &den )
{
int m1=num,n1=den;
int a=1;
if(num!=0)
{
int temp;
if(num>den)
{
temp=den;
den=num;
num=temp;
}
while(num!=0)
{
a=den%num;
den=num;
num=a;
}
if(num!=0)
{
int temp;
if(num>den)
{
temp=den;
den=num;
num=temp;
}
while(num!=0)
{
a=den%num;
den=num;
num=a;
}
}
}
num=m1/den;
den=n1/den;
}
int main()
{
int a1,b1,a2,b2,c;
scanf("%d%c%d",&a1,&c,&b1);
getchar();
scanf("%d%c%d",&a2,&c,&b2);
int m=GCD(b1,b2);
a1=(m/b1)*a1+(m/b2)*a2;
gcd(a1,m);
if(m==1) printf("%d",a1);
else printf("%d/%d",a1,m);
return 0;
}