Nth prime puzzle

Primes.java

public class Primes {
	
	public static void main(String[] args) {
		
		int n = 34;
		
		int count = 0;
		// for (int k=2; ; k++) {
		int k = 2;
		while (true) {
			boolean isPrime = true;
			// for (int j=2; j<k; j++) {
			int j = 2;
			while (j < k) {
				if (k % j != 0) {				   
				}
				else {
					isPrime = false;
					break;   
				}
				j++;
			}
			if (isPrime) {
				count++;
			}
			if (count == n) {
				System.out.println(k);
				return;
			}
			
			k++;
		}
	}
}