import java.util.Arrays;
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner in=new Scanner(System.in);
int n=in.nextInt();
String arr[]=new String[n];//分数
while(n-->0)
{
arr[n]=in.next();
}
int a=0,b=0;
for(int i=0;i<arr.length;i++)
{
String brr[]=arr[i].split("/");//分子0,分母1
int a1=Integer.valueOf(brr[0]),b2=Integer.valueOf(brr[1]);
if(i==0){a=a1;b=b2;continue;}
a=a*b2+b*a1;
b=b*b2;
int t=cqc(a,b);//最大公约树
a=a/t;
b=b/t;
}
if(a%b==0)System.out.print(a/b);//整数部分
else
{ if(a==a%b)System.out.print(a+"/"+b);
else System.out.print(a/b+" "+a%b+"/"+b);
}System.out.println();
}
public static int cqc(int m,int n)
{
int t;
if(m<n){t=m;m=n;n=t;}
while(n!=0)
{
t=m%n;
m=n;
n=t;
}
return m;
}
}