1772: StrongPrimePower

A number which can be represented as pq, where p is a prime number and q is an integer greater than 0, is called a prime power. If q is larger than 1, we call the number a strong prime power. You are given an integer n. If n is a strong prime power, output an int[] containing exactly two elements. The first element is p and the second element is q. If n is not a strong prime power, output an empty int[].

For each line, you are given an integer n . n will contain digits (‘0‘ - ‘9‘) only. n will represent an integer between 2 and 10^18, inclusive. n will have no leading zeros.

Output an int[] containing exactly two elements. The first element is p and the second element is q. If n is not a strong prime power, output an empty int[].

27
10
576460752303423488

3 3

2 59