#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define mp make_pair
#define pb push_back
#define ft first
#define sd second
#define forn(IND, BEG, END) for (int IND = BEG; IND < END; IND++)
#define INF (int)(2e9 + 7)
#define int long long

main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);

	int n; cin >> n;
	const int N = n;
	vector < int > primes;
	while (n % 2 == 0) {
		n /= 2;
		primes.pb(2);
	}
	for (int i = 3; i * i <= N; i += 2) {
		if (n < i)
			break;
		while (n % i == 0) {
			n /= i;
			primes.push_back(i);
		}
	}
	if (n != 1) {
		primes.pb(n);
		sort(primes.begin(), primes.end());
	}
	cout << primes[0];
	for (int i = 1; i < primes.size(); i++) {
		cout << "*" << primes[i];
	}
}