ACM-TDMU

#### Start

2018-05-24 15:00 UTC

## ACM-TDMU

#### End

2018-05-27 17:00 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -363 days 19:39:41

74:00:00

0:00:00

# Problem FPrsteni

After an exhausting morning, Mirko fell asleep. His brother Stanko, however, just awoke and, like his brother, is all about excitement. Stanko found N rings of varying radiuses in the garage. He arranged them on the floor so that each ring (except the first and last) touches the ones before and after it.

He started turning the first ring and noticed that the other rings turned as well; some faster, some slower!

Thrilled with his discovery, he decided to count how many times the other rings turn while the first ring turns once. He gave up after noticing that this number is not always an integer and not knowing what to do.

Write a program that determines how many times each ring turns while the first turns once.

## Input

The first line of input contains an integer $N (3 \leq N\leq 100)$, the number of rings.

The next line contains $N$ integers between 1 and 1000, the radiuses of Stanko’s rings, in the order they are laid out on the floor.

## Output

The output must contain $N-1$ lines. For every ring other than the first, in the order they are given in the input, output a fraction $A/B$, meaning that the respective ring turns $A/B$ times while the first ring turns once. The fractions must be in reduced form (the numerator and denominator must not have a common divisor larger than 1).

Sample Input 1 Sample Output 1
3
8 4 2

2/1
4/1

Sample Input 2 Sample Output 2
4
12 3 8 4

4/1
3/2
3/1

Sample Input 3 Sample Output 3
4
300 1 1 300

300/1
300/1
1/1