{"raw_statement":[{"iden":"problem statement","content":"Find the smallest possible sum of the digits in the decimal notation of a positive multiple of $K$."},{"iden":"constraints","content":"*   $2 \\leq K \\leq 10^5$\n*   $K$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$"},{"iden":"sample input 1","content":"6"},{"iden":"sample output 1","content":"3\n\n$12=6×2$ yields the smallest sum."},{"iden":"sample input 2","content":"41"},{"iden":"sample output 2","content":"5\n\n$11111=41×271$ yields the smallest sum."},{"iden":"sample input 3","content":"79992"},{"iden":"sample output 3","content":"36"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}