An integer n is considered a power of two if it can be expressed as n $==2^x$, where $x$ is an integer.

Determine whether a given integer n is a power of two. If it is, then return TRUE; otherwise, return FALSE.

Constraints:

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

The main idea of this solution is to use bit manipulation to check whether a number contains only one set bit in its binary representation. Powers of two are always positive and have exactly one bit set to $1$, while all other bits are $0$. First, verify that the number is greater than zero, as negative numbers and zero cannot be powers of two. Then, use the property that for any power of two, subtracting 1 from n turns the rightmost 1-bit into $0$ and flips all bits to the right of it to $1$. Performing a bitwise AND between n and n - 1 gives zero only for powers of two, confirming that the number contains exactly one set bit.