Problem 7. 10001st prime

public class euler7 {
    public static void main(String[] args) {
        int count = 10001;
        int i = 0;
        for (i = 1; count > 0; i++) {
            if (isPrime(i))
            count--;
        }
        System.out.println(i-1);
    }
    public static boolean isPrime(long n) {
        if (n <= 1) return false;
        long i = 2;
        while (i*i <= n) {
            if (n % i == 0)
                return false;
            i++;
        }
        return true;
    }
}