// power of 2 must have only 1 set bit

,n & (n - 1) removes lowest set bit which is the only set bit, so n&(n-1) == 0

, power must be positive

```
public class Solution {
public boolean isPowerOfTwo(int n) {
return n > 0 && (n & (n - 1)) == 0;
}
}
```