Problem:
Score : 700 points

Problem Statement

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

Constraints

2 \leq K \leq 10^5

K is an integer.

Input

Input is given from Standard Input in the following format:

K

Output

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

Sample Input 1

6

Sample Output 1

3

12=6×2 yields the smallest sum.

Sample Input 2

41

Sample Output 2

5

11111=41×271 yields the smallest sum.

Sample Input 3

79992

Sample Output 3

36

Solution in Scala (2.11.7) (judge verdict: Wrong Answer)

object Main extends App {
	val k = scala.io.StdIn.readInt
	
	def test(x: Int): Int = {
		var result = x % 10
		var y = x / 10
		while(y != 0){
			result = result + y % 10
			y = y / 10
		}
		return result;
	} 

	val a = test(k)
	var y = k+k

	var temp = test(y)
	var result = a

	while(temp != a){
		if(temp < a) result = temp
		y = y + k
		temp = test(y)
	}

	println(result)

}