Power of Three

Given an integer, write a function to determine if it is a power of three.

Follow up:
Could you do it without using any loop / recursion?

class Solution {
public:
    bool isPowerOfThree(int n) {
        if (n > 1){
            while (n != 0){
                if (n % 3 == 0){
                    n /= 3;
                    if (n == 1){
                        break;
                    }
                }else{
                    return false;
                }
            }
            return true;
        }else if (n == 1){
            return true;
        }else{
            return false;
        }
    }
};