Given an integer n, determine whether it is a power of three. Return TRUE if it is, and FALSE otherwise.

An integer n is considered a power of three if there exists an integer x such that n $== 3^x$.

Note: Could you solve it without using loops or recursion?

Constraints:

• $-2^{31} \leq$ n $\leq 2^{31} - 1$

The key insight is that since $3$ is a prime number, any power of $3$ will only have $3$ as its prime factor. The largest power of $3$ that fits within a $32$-bit signed integer range is $3^{19} = 1162261467$ ...