Factoring Large Numbers

<p>One of the central ideas behind much cryptography is that factoring large numbers is computationally<br /> intensive. In this context one might use a 100 digit number that was a product of two 50 digit prime<br /> numbers. Even with the fastest projected computers this factorization will take hundreds of years.<br /> You don&rsquo;t have those computers available, but if you are clever you can still factor fairly large numbers.</p>

<p>The input will be a sequence of integer values, one per line, terminated by a negative number. The<br /> numbers (other than the terminator) will be greater than 0 and less than 2⁶² .</p>

<p>Each positive number from the input must be factored and all factors (other than 1) printed out. The<br /> factors must be printed in ascending order with 4 leading spaces preceding a left justified number, and<br /> followed by a single blank line.</p>