#include<bits/stdc++.h> using namespace std; int n,cnt,prime[100001]; bool p[10000001]; int main(){ memset(p,1,sizeof(p)); cin>>n; for(int i=2;i<=n;i++) if(p[i]==1){ for(int j=2;j*i<=n;j++)p[(j*i)]=0; cnt++; prime[cnt]=i; } cout<<n<<"="; for(int i=1;i<=cnt;i++)if(n%prime[i]==0) while(n%prime[i]==0){ n/=prime[i]; if(n==1){ cout<<prime[i]<<endl; return 0; } else cout<<prime[i]<<"*"; } return 0; }