#include<iostream> #include<math.h> #include<fstream> using namespace std; const int maxn = 65535; bool isprime[maxn]; int prime[maxn/2]; int ans[32]; int getprime(int n) { memset(isprime, true, sizeof(isprime)); int i, j, k = 0; int s, e = sqrt(n*1.0+1); prime[k++] = 2; isprime[0] = isprime[1] = false; for(i=4; i<n; i+=2) isprime[i] = false; for(i=3; i<e; i+=2) { if(isprime[i]) { prime[k++] = i; for(s=i*2, j=i*i; j<n; j+=s) { isprime[j] = false; } } } for(; i<n; i+=2) { if(isprime[i]) prime[k++] = i; } return k; } int solve(int n, int k) { int j = 0; for(int i=0; i<k; i++) { while(n%prime[i]==0 && n>1) { ans[j++] = prime[i]; n /= prime[i]; } if(n<=1) break; } return j; } int main() { int k = getprime(65535); //freopen("out.txt", "w", stdout); //freopen("in.txt", "r", stdin); int n; while(scanf("%d", &n)!=EOF) { int x = solve(n, k); for(int i=0; i<x; i++) { if(i!=x-1) printf("%d*", ans[i]); else printf("%d/n", ans[i]); } } return 0; }