#arc084b. [arc084_b]Small Multiple

[arc084_b]Small Multiple

Problem Statement

Find the smallest possible sum of the digits in the decimal notation of a positive multiple of KK.

Constraints

  • 2leqKleq1052 \\leq K \\leq 10^5
  • KK is an integer.

Input

Input is given from Standard Input in the following format:

KK

Output

Print the smallest possible sum of the digits in the decimal notation of a positive multiple of KK.


Sample Input 1

6

Sample Output 1

3

12=6×212=6×2 yields the smallest sum.


Sample Input 2

41

Sample Output 2

5

11111=41×27111111=41×271 yields the smallest sum.


Sample Input 3

79992

Sample Output 3

36