Problem:
Prime Factorization

Factorize a given integer n.

Input

n

An integer n is given in a line.

Output

Print the given integer n and :. Then, print prime factors in ascending order. If n is divisible by a prime factor several times, the prime factor should be printed according to the number of times. Print a space before each prime factor.

Constraints

2 ≤ n ≤ 109

Sample Input 1

12

Sample Output 1

12: 2 2 3

Sample Input 2

126

Sample Output 2

126: 2 3 3 7

Solution in C# (judge verdict: WA: Presentation Error)

using System;
class Example
{
    static void Main()
    {
        int n = int.Parse(Console.ReadLine());
        Console.Write(n + ":");
        while(n % 2 ==0)
        {
            Console.Write(" 2");
            n = n / 2;
        }

        for(int i = 3; i <= n; i = i + 2)
        {
            while( n % i ==0)
            {
                Console.Write(" " +i);
                n = n / i;
            }
        }

    }
}