#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<algorithm>

 #include<ctime>

 #include<cmath>

 #include<iostream>

 using namespace std;

 #define LL long long

 LL n;

 #define maxs 80

 LL fac[maxs],num[maxs],lf=;

 LL mul(LL a,LL b,LL p)

 {

     LL tmp=a,ans=;

     while (b) {if (b&) ans=(ans+tmp)%p;tmp=(tmp+tmp)%p;b>>=;}

     return ans;

 }

 LL random(LL x) {return (LL)((double)rand()/RAND_MAX*(x-)+0.5);}

 LL f(LL x,LL c,LL p) {return (mul(x,x,p)+c)%p;}

 LL gcd(LL a,LL b) {if (a<b) return gcd(b,a);return b?gcd(b,a%b):a;}

 LL play(LL x,LL c)

 {

     LL a=random(x-)+,b=f(a,c,x),i=,k=;

     if (a==b) return x;

     while (++i)

     {

         LL sig=gcd(fabs(a-b),x);

         if (sig> && sig<x) return sig;

         b=f(b,c,x);

         if (a==b) return x;

         if (i==k) a=b,k<<=;

     }

 }

 LL pow_mod(LL a,LL b,LL p)

 {

     LL tmp=a,ans=;

     while (b) {if (b&) ans=mul(ans,tmp,p);tmp=mul(tmp,tmp,p);b>>=;}

     return ans;

 }

 bool is_prime(LL x)

 {

     LL num=x-,k=;while (!(num&)) num>>=,k++;

     for (int i=;i<=;i++)

     {

         LL t=random(x-)+,jud=pow_mod(t,num,x),now=jud;

         for (int j=;j<=k;j++)

         {

             jud=mul(jud,jud,x);

             if (jud== && now!= && now!=x-) return ;

             now=jud;

         }

         if (jud!=) return ;

     }

     return ;

 }

 void rho(LL x,LL c)

 {

     if (x==) return;

     if (is_prime(x)) {fac[++lf]=x;return;}

     LL p=x,tmp=c;

     while (p==x) p=play(x,tmp--);

     rho(p,c);rho(x/p,c);

 }

 int main()

 {

     srand(time(NULL));

     scanf("%lld",&n);

     memset(fac,,sizeof(fac));

     rho(n,);sort(fac+,fac++lf);num[]=;LL nlf=;

     for (int i=;i<=lf;i++)

         if (fac[i-]==fac[i]) num[nlf]++;

         else num[++nlf]=,fac[nlf]=fac[i];

     lf=nlf;

     for (int i=;i<lf;i++) printf("%lld^%lld*",fac[i],num[i]);printf("%lld^%lld\n",fac[lf],num[lf]);

     return ;

 }