rt,RE on #4	。虽然这场比赛我就是来摸鱼的
#include <iostream>
using namespace std;
#define int long long
inline int gcd(int a,int b) {
a=(a<0?-a:a),b=(b<0?-b:b);
while(b^=a^=b^=a%=b);return a;
}
int n,a,b,opt,x=0,y=1;
inline void add() {
int g=y*b,h=x*b+y*a;
int tmp=gcd(g,h);
y=g/tmp,x=h/tmp;
}
inline void sub() {
int g=y*b,h=x*b-y*a;
int tmp=gcd(g,h);
y=g/tmp,x=h/tmp;
}
signed main () {
cin>>n;
while(n--) {
cin>>a>>b>>opt;
switch(opt) {
case 1:
add();break;
case 2:
sub();break;
}
}
if(x%y) cout<<x<<'/'<<y<<endl;
else cout<<x/y<<endl;
return 0;
}