[프로그래머스] 합성수 찾기

class Solution {
    public int solution(int n) {
        int count = 0;
        for (int i = 4; i <= n; i++) {
            if (isValue(i)) count++;
        }
        return count;
    }

    public static boolean isValue(int number) {
        int cnt = 0;
        for (int i = 1; i <= number / 2 + 1 ; i++) {
            if (number % i == 0) cnt++;
        }
        return cnt >= 2;
    }
}