提示: 欢迎访问OurACM平台。
Problem 1791 Snail's trouble

Accept: 34    Submit: 169
Time Limit: 5000 mSec    Memory Limit : 32768 KB

Problem Description

Once upon a time, there was a poor snail. Every day, it tried very hard to crawl forward, while there was a keeper who'd like to maltreat this poor little snail. The snail was crawling on a one-meter rubber band at first, and it can move on k cm every minute. But after that, the keeper stretches the rubber band quickly, and it would be elongated one meter, during that the distances ratio between the snail and the two endpoints remain unchanged. In the next minute, little snail tried to keep moving forward again.

"Can I finally get to the endpoint?"

The snail often asked himself such a question because he was afraid he would never succeed. Now, we hope you can tell this poor snail when he would reach the endpoint.

Input

Every line of the input contains an integer number k, indicating that the snail moved forward k cm every minute. (5 ≤ k ≤ 100)

Output

Output an integer t, indicating that the snail doesn't get to the endpoint until t-1 minutes later, while t minutes later, it finally succeed.

Sample Input

10 100

Sample Output

12367 1

Source

Multi-School Training Contest - TOJ Site #2

Submit  Back  Status  Discuss