1040 -- Ones
Time Limit :1000 MS Memory Limit :32768 KB
Accepts : 266 Submits : 509
User Accepts : 207 User Submits : 218
<Submit>   <Statistics>   <Discuss>

Description
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?

Input
Each line contains a number n.

Output
Output the number of digits.

Sample Input

3 
7 
9901

Sample Output

3
6
12

Source

Waterloo local 2001.06.02
<Submit>   <Statistics>   <Discuss>
 


Powered by Zhang Zhaoning PDL College of Computer
Since 2006.03.09 | 2007.11.22 | 2010.03.02 Copyright (r) 2006 - 2010 All Rights Reserved