Preparando MOJI

Four Divisors

10000ms 786432K

Description:

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).

Input:

The only line contains integer n (1 ≤ n ≤ 1011) — the parameter from the problem statement.

Output:

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

Sample Input:

10

Sample Output:

3

Sample Input:

20

Sample Output:

5

Informação

Codeforces

Provedor Codeforces

Código CF665F

Tags

data structuresdpmathnumber theorysortingstwo pointers

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:06:05

Relacionados

Nada ainda