#include <iostream>
#include <cmath>

typedef unsigned long long ulong;

void print_prime_factors(ulong n)
{
    std::cout << n << ": ";
    if (!n) { std::cout << "0 is not a composite number.\n"; return; }
    
    ulong sqrt_n = sqrt(n);
    for (ulong i=2; i<=sqrt_n && n!=1; ++i)
    {
        if (n%i==0) { std::cout << i << " "; }
        while (n%i==0) { n /= i; }
    }
    if (n != 1) { std::cout << n; }  //now n is a prime, must output it!
    
    std::cout << "\n";
}

int main()
{
    ulong n;
    while (std::cin >> n) { print_prime_factors(n); }
}