#include "bits/stdc++.h"
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a)  (a).begin(),(a).end()
#define IOS std::cin.tie(0),std::ios::sync_with_stdio(false)

namespace idaten {

	using namespace std;
	using ll = int_fast64_t;
	using ull = uint_fast64_t;
	using P = std::pair<int64_t, int64_t>;
	template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
	template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
	template<class Type>struct is_vector : std::false_type {};
	template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
	template <typename T> inline std::ostream& operator << (std::ostream& out, const std::vector<T>& v) {
		if (v.empty())return out;
		constexpr bool is_vector_v = is_vector<T>::value;
		if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
		else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
		return out;
	}
	inline void put() {}
	template<class T> inline void put(const T& first) { std::cout << first << "\n"; }
	template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }
	inline void putn() {}
	template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }

	template<typename T> inline
		vector<pair<T, int>> factoring(T n) {
		static int64_t border = 1 << 20;
		static vector<int> smallest_prime_factors(4, 0);
		smallest_prime_factors[2] = 2;
		smallest_prime_factors[3] = 3;
		vector<pair<T, int>> res;
		if (n <= border) {
			int64_t preSize = smallest_prime_factors.size();
			if (preSize + 1 <= n) {
				int64_t t = preSize;
				while (t <= n) {
					t *= 2;
				}
				smallest_prime_factors.resize(t, -1);
				for (int64_t i = 2; i < t; ++i) {
					if (smallest_prime_factors[i] == i) {
						int64_t start = min(i * i, (preSize + i - 1) / i * i);
						for (int64_t j = start; j < t; j += i) {
							if (smallest_prime_factors[j] == -1) {
								smallest_prime_factors[j] = i;
							}
						}
					} else if (smallest_prime_factors[i] == -1) {
						smallest_prime_factors[i] = i;
						int64_t start = i * i;
						for (int64_t j = start; j < t; j += i) {
							if (smallest_prime_factors[j] == -1) {
								smallest_prime_factors[j] = i;
							}
						}
					}
				}
			}
			while (n >= 2) {
				T spf = smallest_prime_factors[n];
				n = n / spf;
				if (res.size()>0 && res.back().first == spf) {
					res.back().second++;
				} else {
					res.push_back(pair<T, int>(spf, 1));
				}
			}
		} else {
			int64_t spfSize = smallest_prime_factors.size();
			vector<pair<T, int>> res2;
			for (int64_t i = 2; i < spfSize && i*i<= n; i++) {
				if (smallest_prime_factors[i] == i) {
					if (n % i == 0) {
						res.push_back(pair<T, int>(i, 1));
						n /= i;
						while (n % i == 0) {
							res.back().second++;
							n /= i;
						}
						if (n <= border) {
							res2 = factoring(n);
							n = 1;
						}
					}
				}
			}
			for (int64_t i = spfSize + 1; i * i <= n; i+= 2) {
				if (n % i == 0) {
					res.push_back(pair<T, int>(i, 1));
					n /= i;
					while (n % i == 0) {
						res.back().second++;
						n /= i;
					}
					if (n <= border) {
						res2 = factoring(n);
						n = 1;
					}
				}
				
			}
			for (auto&& v : res2) {
				res.push_back(v);
			}
			if (n != 1) {
				res.push_back(pair<T, int>(n, 1));
			}
		}
		return res;
	}

	void solve() {
		IOS;
		int n;
		cin >> n;
		auto f = factoring(n);
		cout << n << ":";
		for (auto&& v : f) {
			REP(i, v.second) {
				cout << " " << v.first;
			}
		}
		put("");
	}

} // namespace idaten

int main() {
	idaten::solve();
	return 0;
}


Measured memory_bytes: 6976