#include<bits/stdc++.h>
using namespace std;
void gcd(long int &A, long int &B) {
long int g = __gcd(A, B);//求最大公因数
A /= g;//约分
B /= g;
}
int main() {
int N;
int long a, b, x, y;
cin >> N;
scanf("%ld/%ld", &a, &b);//a分子,b分母
for (int i = 1; i < N; i++) {
scanf("%ld/%ld", &x, &y);
a = a * y + x * b;
b = b * y;
gcd(a, b);
}
if(a % b == 0) //结果为整数时
cout << a/ b << endl;
else
{
if(a / b)//当分子大于分母
cout << a/ b << " ";
cout << a - a/b * b<< '/' << b << endl;
}
}