{"raw_statement":[{"iden":"problem statement","content":"Given a positive integer $K$, find the number of triples of positive integers $(A, B, C)$ such that $ABC \\leq K$. Two triples that only differ in the order of numbers are also distinguished."},{"iden":"constraints","content":"*   $1\\leq K\\leq 2\\times 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":"2"},{"iden":"sample output 1","content":"4\n\nWe have the following triples: $(1,1,1),(1,1,2),(1,2,1),(2,1,1)$."},{"iden":"sample input 2","content":"10"},{"iden":"sample output 2","content":"53"},{"iden":"sample input 3","content":"31415"},{"iden":"sample output 3","content":"1937281"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}