Prime factorization

You are given a natural number $n$ ($n \ge 2$). Factor it into primes. For example, $12 = 2 \cdot 2 \cdot 3$.

A single integer $n$ ($2 \le n \le 10^{12}$).

A single line with the prime factors in increasing order, with repetitions, separated by spaces.

Starting from $d = 2$: while $n$ is divisible by $d$, write $d$ down and divide $n$ by $d$; then increase $d$. Loop while d * d <= n. If $n > 1$ is left at the end, it is a prime factor too (for example, $97$ itself).