Given an integer n, return true if n is a power of four. Otherwise, return false.

A number is a power of four if there exists an integer x such that n = 4^x.

Note: Follow up: can you solve it without using loops or recursion?

Constraints:

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

Input: n = 16-int
Output: true-bool
Explanation: 16 = 4^2, so it is a power of four.

Input: n = 5-int
Output: false-bool
Explanation: 5 cannot be written as 4^x for any integer x.

Input: n = 1-int
Output: true-bool
Explanation: 1 = 4^0, so it is a power of four.

Input: n = 0-int
Output: false-bool
Explanation: Powers of four are positive, so 0 is not a power of four.

Input: n = -64-int
Output: false-bool
Explanation: Powers of four are positive, so negative numbers cannot be powers of four.

Input: n = 64-int
Output: true-bool
Explanation: 64 = 4^3, so it is a power of four.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.