leetcode 326. 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) return false;
        while(n % 3 == 0){
            n = n / 3;
        }
        return n == 1;
    }
};