Given a list of integers, return 1 if the integer is a power of 2 and 0 if it is not.

A number is a power of 2 if it's positive and has only one bit set in its binary representation. A common and efficient way to check this is to use the bitwise AND operation: (n & (n - 1)) == 0. This works because subtracting 1 from a power of 2 flips the rightmost set bit to 0 and all bits to its right to 1. Performing a bitwise AND between the original number and the decremented number will result in 0 if and only if the original number was a power of 2 (and positive).