patA1081 Ration Sum

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn=100;
typedef long long ll;
struct Faction{
long long up,down;
};
Faction f[maxn];
long long gcd(long long a,long b){
return b == 0 ? a : gcd(b,a%b);
} 


void print(Faction x){
if(x.down==1) printf("%ld",x.up);
else if(x.up > x.down){
printf("%ld %ld/%ld",x.up/x.down,abs(x.up)%x.down,abs(x.down));
}else{
printf("%ld/ld",x.up,x.down);
}
}
Faction reduction(Faction a){
if(a.down<0){
a.up=-a.up;
a.down=-a.down;
}else if(a.up==0){
a.down=1;
}else{
long long d=gcd(abs(a.up),abs(a.down));
a.up=a.up/d;
a.down=a.down/d;
}
return a;
}
void add(Faction *f,int n){
Faction ans;
ans.up=0; ans.down=1;
for(int i=0;i<n;i++){
ans.up =ans.up*f[i].down + f[i].up*ans.down;
ans.down =ans.down * f[i].down;
   reduction(ans);
}
// reduction(ans);
// printf("%ld/%ld",ans.up,ans.down);
print(ans);
}


int main(int argc, char** argv) {
int N;
scanf("%d",&N);
for(int i=0;i<N;i++) scanf("%ld/%ld",&f[i].up,&f[i].down);
add(f,N);
return 0;
}