As you can now check for the primality of any number, you are now asked to check if the number is prime for all the numbers up to n and print all the prime ones.
Input
The first line of the input contains a single integer n (2 β€ n β€ ).
Output
The program should print all the prime numbers smaller than or equal to n.