private void findPrime(int which){
		int primeCount = 0;
		for (long i = 3; primeCount < which; i=i+2){
			if (isPrime(i)){
				primeCount++;
				if(primeCount == (which-1)){
					System.out.println(i);
				}
			}
		}
	}