Given an integer n, return true if it is a power of two recursively. An integer n is a power of two if there exists an integer x such that n == 2^x.
Explanation: 16 is 2^4.
Explanation: 3 is not a power of two.