public class PrimeChecker {
    // Method to check if a number is prime
    public static Boolean isPrime(Integer num) {
        // Check if the number is less than 2
        if (num < 2) {
            // Numbers less than 2 are not prime
            return false;
        }
        // Loop from 2 to the square root of the number
        for (Integer i = 2; i <= Math.sqrt(num); i++) {
            // If the number is divisible by i, it's not prime
            if (num % i == 0) {
                // Return false if a divisor is found
                return false;
            }
        }
        // If no divisors are found, the number is prime
        return true;
    }
}

cHVibGljIGNsYXNzIFByaW1lQ2hlY2tlciB7CiAgICAvLyBNZXRob2QgdG8gY2hlY2sgaWYgYSBudW1iZXIgaXMgcHJpbWUKICAgIHB1YmxpYyBzdGF0aWMgQm9vbGVhbiBpc1ByaW1lKEludGVnZXIgbnVtKSB7CiAgICAgICAgLy8gQ2hlY2sgaWYgdGhlIG51bWJlciBpcyBsZXNzIHRoYW4gMgogICAgICAgIGlmIChudW0gPCAyKSB7CiAgICAgICAgICAgIC8vIE51bWJlcnMgbGVzcyB0aGFuIDIgYXJlIG5vdCBwcmltZQogICAgICAgICAgICByZXR1cm4gZmFsc2U7CiAgICAgICAgfQogICAgICAgIC8vIExvb3AgZnJvbSAyIHRvIHRoZSBzcXVhcmUgcm9vdCBvZiB0aGUgbnVtYmVyCiAgICAgICAgZm9yIChJbnRlZ2VyIGkgPSAyOyBpIDw9IE1hdGguc3FydChudW0pOyBpKyspIHsKICAgICAgICAgICAgLy8gSWYgdGhlIG51bWJlciBpcyBkaXZpc2libGUgYnkgaSwgaXQncyBub3QgcHJpbWUKICAgICAgICAgICAgaWYgKG51bSAlIGkgPT0gMCkgewogICAgICAgICAgICAgICAgLy8gUmV0dXJuIGZhbHNlIGlmIGEgZGl2aXNvciBpcyBmb3VuZAogICAgICAgICAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgICAgIC8vIElmIG5vIGRpdmlzb3JzIGFyZSBmb3VuZCwgdGhlIG51bWJlciBpcyBwcmltZQogICAgICAgIHJldHVybiB0cnVlOwogICAgfQp9