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?

 public class Solution {
     public boolean isPowerOfThree(int n) {
         if (n == )    return false;

         if (n == ) return true;

         if (n > )
             return n %  ==  && isPowerOfThree(n / );
         else
             return false;
     }
 }