判断一个数是不是2的n次方

public static boolean nCF3(int n)
    {
        boolean boo = false;
        String s = Integer.toBinaryString(n);
        Pattern p=Pattern.compile("^10+$");
        Matcher m=p.matcher(s);
        if(m.find()){
            return true;
        }
//        byte[] b = s.getBytes();
//        for (int i = 1; i < b.length; i++)
//        {
//            if (b[i] != 48)
//            {
//                boo = false;
//            }
//        }
        return boo;

    }