Power of Two Guard

Binary Alignment

Powers of two (1, 2, 4, 8, 16...) have a unique property in binary: they only have a single 1 bit. Subtracting 1 from a power of two flips all bits.

For example: 8 is 1000, and 7 is 0111. Performing 8 & 7 results in 0000.

The Assignment

Your function receives a positive integer n.

1. Return true if n is a power of two.
2. Return false otherwise.
3. Requirement: Solve this in one line using bitwise operators (&) and without loops.