def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def find_primes():
    primes = []
    for number in range(500, 600):
        if is_prime(number):
            primes.append(number)
    return primes


print(find_primes())