For xinye666

#include <stdio.h>
#include <iostream>
#define int long long  // 开 long long !!!
#define con putchar_unlocked(' ')
#define ent putchar_unlocked('\n')
#define op(c) putchar_unlocked(c)
#define Blue_Archive return 0
using namespace std;
constexpr int N = 1e6 + 3; // 数组开到 根号 即可
constexpr char me[] = "終末なにしてますか？忙しいですか？救ってもらっていいですか？";int n;
int top;
int stk[N];
int tim[N];inline int read() // 快读
{int k = 0,f = 1;char c = getchar_unlocked();while(c < '0' || c > '9') c = getchar_unlocked();while(c >= '0' && c <= '9') k = (k << 3) + (k << 1) + c - '0',c = getchar_unlocked();return k * f;
}inline void write(int x) // 快写
{if(x < 0) putchar_unlocked('-'),x = -x;if(x > 9) write(x / 10);putchar_unlocked(x % 10 + '0');
}inline int max(int x,int y){return x > y ? x : y;}
inline int min(int x,int y){return x < y ? x : y;}signed main()
{	#ifndef ONLINE_JUDGEfreopen("data.in","r",stdin);freopen("data.out","w",stdout);#endifn = read();for(int i = 2;i * i <= n;i ++) // 枚举小于 \sqrt{n} 的质因子{if(n % i == 0){stk[++ top] = i; // 记录模数while(n % i == 0) n /= i,tim[top] ++; // 记录次数}}if(n > 1) // 有一个大于 \sqrt{n} 的质因子{stk[++ top] = n;tim[top] = 1; // 只出现过一次}for(int i = 1;i <= top;i ++){if(tim[i] == 1) write(stk[i]);else {write(stk[i]);op('^');write(tim[i]);}if(i != top) con,op('*'),con;}Blue_Archive;
}