No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Almost Prime

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and *n*, inclusive.

Input

Input contains one integer number *n* (1 ≤ *n* ≤ 3000).

Output

Output the amount of almost prime numbers between 1 and *n*, inclusive.

Examples

Input

10

Output

2

Input

21

Output

8

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 18:27:11 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|