Primes up to N ⭐⭐

Write a program that reads an integer $N$ and displays all prime numbers between 2 and $N$.

Requirements:

1. You must implement a function called esPrimo(int num) that returns a boolean value (true or false).
2. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

Input

An integer $N$ ($N \ge 2$).

Output

A sequence of prime numbers from 2 up to $N$, separated by a space.

Example

Input: 20

Output: 2 3 5 7 11 13 17 19