// Define the isPrime function
boolean isPrime(int n) {
    if (n < 2) {
        return false;
    }
    if (n == 2) {
        return true;
    }
    if (n % 2 == 0) {
        return false;
    }
    for (int i = 3; i <= Math.sqrt(n); i += 2) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

// Main algorithm
List<Integer> primeNumbers = new ArrayList<>();

for (int number = 500; number <= 599; number++) {
    if (Integer.toString(number).startsWith("5")) {
        if (isPrime(number)) {
            primeNumbers.add(number);
        }
    }
}

// Print the prime numbers
for (int prime : primeNumbers) {
    System.out.println(prime);
}