module m

contains

    recursive integer(kind=8) function gcd(a,b)result(res)
        integer(kind=8)::a,b
        if(a<b)then
            res=gcd(b,a)
            return
        end if
        if(b==0)then
            res=a
        else
            res=gcd(mod(a,b),b)
        end if
    end function

end module

program main
    use m
    implicit none
    integer(kind=8)::i,j,k,x,y,z,w,r,a,b,c,tmp
    integer(kind=8)::t1,t2,t3,den,num
    num=1000000000000_8
    den=1
    read*,t1,t2,t3!t1<t2<t3
    do i=-1,1,2
        do j=-1,1,2
            x=t3+i*t1
            y=t3*t1
            z=t3+j*t2
            w=t3*t2
            tmp=gcd(x,y)
            x=x/tmp
            y=y/tmp
            tmp=gcd(z,w)
            z=z/tmp
            w=w/tmp
            a=y*w
            b=gcd(y*z,x*w)
            tmp=gcd(a,b)
            a=a/tmp
            b=b/tmp
            if(a*den<num*b)then
                num=a
                den=b
            end if
        end do
    end do
    print "(i0,'/',i0)",num,den
end program