Author:  A. Klenin  Time limit:  1 sec  
Input file:  input.txt  Memory limit:  256 Mb  
Output file:  output.txt 
Vasya likes to decrease numbers, but does not like negative numbers. So, he picks some integer A_{1} and starts to decrease it by 100 and take an absolute value of the result. In other words, on each step he calculates next number in the sequence A_{i + 1} = A_{i} − 100.
When Vasya calculates a number which was already present in the sequence, he gets bored and stops. Your program must, given A_{1}, determine the number of steps Vasya would perform.
For example, if A_{1} = 1 then A_{2} = 1 − 100 = 99, and A_{3} = 99 − 100 = 1, so Vasya performs 2 steps.
Input file contains a single integer A_{1}.
Output file must contain a single integer N — number of steps.
0 ≤ A_{1} ≤ 10^{9}
No.  Input file (input.txt ) 
Output file (output.txt ) 

1 


2 


3 

