A*B*C

Given a positive integer $k$, find the number of triples of positive integers $(a,b,c)$ such that $a\cdot b\cdot c\le k$. Two triples that only differ in the order of numbers are also distinguished.

Input

One integer $k(1\le k\le 2\cdot 10^5)$.

Output

Print the number of triples of positive integers $(a,b,c)$ such that $a\cdot b\cdot c\le k$.

Examples