Given a fraction, find its simplest fraction representation.
There many cases in the input. In each case, each line contains two integers a and b (a, b <= 100000), which represent the numerator and the denominator of a fraction. Input will be terminated by EOF.
For each case, output a line with the simplest fraction.