CF665F.Four Divisors

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

If an integer $a$ is divisible by another integer $b$ , then $b$ is called the divisor of $a$ .

For example: $12$ has positive $6$ divisors. They are $1$ , $2$ , $3$ , $4$ , $6$ and $12$ .

Let’s define a function $D(n)$ — number of integers between $1$ and $n$ (inclusive) which has exactly four positive divisors.

Between $1$ and $10$ only the integers $6$ , $8$ and $10$ has exactly four positive divisors. So, $D(10)=3$ .

You are given an integer $n$ . You have to calculate $D(n)$ .

The only line contains integer $n$ ( $1<=n<=10^{11}$ ) — the parameter from the problem statement.

Print the only integer $c$ — the number of integers between $1$ and $n$ with exactly four divisors.