Given a positive integer , 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.
One integer k~(1 \le k \le 2 \cdot 10^5).
Print the number of triples of positive integers (a, b, c) such that a \cdot b \cdot c \le k.
მაგალითი 1
მაგალითი 2