// Description
Given an integer n, count how many prime numbers are less than or equal to n.
// Input
A single integer n (1 <= n <= 10^6).
// Output
The number of primes not greater than n.
// Hint
A sieve of Eratosthenes counts all primes up to n in O(n log log n).