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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
import java.io.*;



public class Main {
    public static long digitSum(long k){
    	long sum = 0;
    	while(k>0){
    		sum+=k%10;
    		k=k/10;
    	}
    	return sum;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long K = sc.nextLong();
        long ans = Long.MAX_VALUE;
        for(int i=1;i<10000000;i++){
        	long x = digitSum(i*K);
        	if(x<ans) ans = x;
        }
        
        System.out.println(ans);
    }
}