Primes up to n

You are given a natural number $n$. Print all prime numbers from $2$ to $n$. A prime is a number greater than $1$ that is divisible only by $1$ and by itself.

A single integer $n$ ($2 \le n \le 10^4$).

A single line with the primes in increasing order, separated by spaces.

The outer loop goes over the numbers from $2$ to $n$, the inner loop searches for divisors. It is enough to check divisors up to $\sqrt{x}$, not up to $$: if is a divisor, so is . Write the condition as .