#include <cstdlib>
#include <cstdio>

const int MaxN = 200010;
const int MaxNum = 200000;

int n, num, p, exp, a[MaxN], leastDiv[MaxNum + 10];
bool prime[MaxNum + 10];

void eratosten(int N, bool prime[], int leastDiv[]) {
	
	for (int i = 0; i <= N; i++) 
			prime[i] = true;
		
	for (int i = 2; i <= N; i++) {
		if (prime[i]) {
			leastDiv[i] = i;
			for (int j = 2; i * j <= N; j++) 
				if (prime[i * j]) {
					prime[i * j] = false;
					leastDiv[i * j] = i;
				}
		}
	}
}

int main() {

	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);

	eratosten(MaxNum, prime, leastDiv);

	for (int i = 0; i < n; i++) {
		num = a[i];

		while (num > 1) {
			p = leastDiv[num];
			exp = 0;
			while (num % p == 0) {
				exp++;
				num /= p;
			}
			if (num > 1) printf("%d^%d*", p, exp);
			else printf("%d^%d\n", p, exp);
		}
	}

	return 0;
}