{"raw_statement":[{"iden":"problem statement","content":"The coins used in the Kingdom of Takahashi are $1!$\\-yen coins, $2!$\\-yen coins, $\\dots$, and $10!$\\-yen coins. Here, $N! = 1 \\times 2 \\times \\dots \\times N$.\nTakahashi has $100$ of every kind of coin, and he is going to buy a product worth $P$ yen **by giving the exact amount without receiving change**.\nWe can prove that there is always such a way to make payment.\nAt least how many coins does he need to use in his payment?"},{"iden":"constraints","content":"*   $1 \\leq P \\leq 10^7$\n*   $P$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$P$"},{"iden":"sample input 1","content":"9"},{"iden":"sample output 1","content":"3\n\nBy giving one $(1! =) 1$\\-yen coin, one $(2! =) 2$\\-yen coin, and one $(3! =) 6$\\-yen coin, we can make the exact payment for the product worth $9$ yen. There is no way to pay this amount using fewer coins."},{"iden":"sample input 2","content":"119"},{"iden":"sample output 2","content":"10\n\nWe should use one $1!$\\-yen coin, two $2!$\\-yen coins, three $3!$\\-yen coins, and four $4!$\\-yen coins."},{"iden":"sample input 3","content":"10000000"},{"iden":"sample output 3","content":"24"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}