NOTE: This problem statement contains superscripts that may not display properly if viewed outside of the applet.
A number which can be represented as p^{q}, 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, return 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, return an empty int[].
