Given an integer , return true if it is a power of two. Otherwise, return false. An integer is a power of two if there exists an integer such that .
Examples: , , , . These are all powers of two. But , , are not.
This problem uses boolean logic with bitwise operations. Before reading on, think: what's special about the binary representation of powers of two?