W - "That clock's 20 minutes fast."

Allison, Andrew, Brian, Claire and John are stuck in the school library on a Saturday, in detention. Evil principal Vernon is making them write an essay. Brian is finding it hard to concentrate. There is still smoke in the air, and his thinking is fuzzy - it is all Bender's fault. Brian is staring at the clock on the wall, and the clock looks strange.

The two hands are both pointing straight up. There are M (1<=M<=1000000000) minute marks on the clock's face. The hour hand moves V1 marks clockwise every second. The minute hand moves V2 marks clockwise every second. (-1000000000<=V1,V2<=1000000000) Negative clockwise speed means positive counter-clockwize speed.

Brian wants to know when the two hands will be on two adjacent minute marks.

For example, if M=5, V1=2 and V2=4, the clock will look like this:

Time: 0 seconds Time: 1 seconds Time: 2 seconds

The answer is 2 because after 2 seconds, the two hands are on adjacent minute marks.

Input

The input will consist of a number of test cases, each one represened by a triple of integers, M, V1 and V2 on a line.

Output

For each test case, print one line. If the two hands will never be on adjacent minute marks, print "Never.". Otherwise, print the smallest number of seconds (an integer) that Brian needs to wait for before the distance between the two hands becomes exactly one minute mark. Follow the output format shown below.

Sample input

60 1 2
60 2 1
5 2 4
5 -4 -2
60 7 17
1 2 3

Sample output

In 1 second(s).
In 1 second(s).
In 2 second(s).
In 2 second(s).
Never.
Never.