Simple program in Julia to check whether a number is prime or not

PrimeCounter.jl

function isPrime(n)
    if n < 2
        return false
    elseif n == 2
        return true
    else
        for i in 2:n-1
            p = n % i
            if p == 0
                return false
                break
            else
                continue
            end
        end
        return true
    end
end

while true
    try
        print("Tampilkan Banyaknya Bilangan Prima antara 1 hingga: ")
        x = parse(Int32, readline())
        let
            global y = 0
            for x in 2:x
                if isPrime(x) == true
                y += 1
                end
            end
        end
        println(y)
        break
    catch
        println("Harap Masukan Bilangan Bulat saja!")
    end
end

PrimeOrNot.jl

function isPrime(n)
    if n < 2
        return false
    elseif n == 2
        return true
    else
        for i in 2:n-1
            p = n % i
            if p == 0
                return false
                break
            else
                continue
            end
        end
        return true
    end
end

print("Enter a number: ")
x = parse(Int32, readline())
println(isPrime(x))