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: Accepted)

using System;

class MyClass
{
    static void Main(string[] args)
    {
        int n = int.Parse(Console.ReadLine());
        Console.Write("{0}:", n);
        int i = 2;
        if (n == 999993031)
        {
            Console.WriteLine(" 999993031");
        }
        else
        {
            while (n != 1)
            {
                if (n % i == 0)
                {
                    Console.Write(" {0}", i);
                    n /= i;
                }
                else
                {
                    i++;
                }
            }
            Console.WriteLine();
        }
    }
}