[Leetcode] Power of Four

Given an integer (signed 32 bits), write a function to check whether it is a power of 4.

Example:
Given num = 16, return true. Given num = 5, return false.

Follow up: Could you solve it without loops/recursion?

public class Solution {
    public boolean isPowerOfFour(int num) {
        if(num<1) return false;
        while(num>3)
        {
            if(((num%4)==1)||((num%4)==2)||((num%4)==3)) return false;
            num=num>>2;
        }
        if(num%4==1) return true;
        else return false;
    }
}