public class Main
{
    
	public static void findPrimeNumbersInGivenInterval() {
	    /* flag for Prime Numbers */
	    boolean isItPrime = true;
	    /* Initializing bounds */
	    int lowerBound = 501;
	    int higherBound = 600;
	    
	    /* At the end of every loop increment i with 2. Because we do not need to check even values */
	    for (int i = lowerBound; i < higherBound; i += 2) {
	        /* clearing isItPrime at every loop */
	        isItPrime = true;
	        
	        /* j loops from 2 to sqrt(i). Because sqrt(i) can be the largest possible divider for prime number */
	        for (int j = 2; j * j <= i; j++) { 
	            
	            /* if j mod i is 0 it is not a prime number. So we make isItPrime = false and end loop */
	            if (i % j == 0) {
	                isItPrime = false;
	                break;
	            }
	            
	        }
	        /* if isItPrime not false we display the value */
	        if (isItPrime) {
	            System.out.println(i);
	        }
	    }
	}
	
	
	public static void main(String[] args) {
	    findPrimeNumbersInGivenInterval();
	}

}