{"raw_statement":[{"iden":"problem statement","content":"You are given a positive integer $N$.\nFind the number of triples of positive integers $(A, B, C)$ such that $A\\leq B\\leq C$ and $ABC\\leq N$.\nThe Constraints guarantee that the answer is less than $2^{63}$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^{11}$\n*   $N$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"5\n\nThere are five such triples: $(1,1,1),(1,1,2),(1,1,3),(1,1,4),(1,2,2)$."},{"iden":"sample input 2","content":"100"},{"iden":"sample output 2","content":"323"},{"iden":"sample input 3","content":"100000000000"},{"iden":"sample output 3","content":"5745290566750"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}