public static void prime(long n) {
	    long a = 1, count = 0, i;

	    while (count < n) {
	        a++;
	        for (i = 2; i <= a; i++) {
	            if (a%i == 0) {
	            	break;
	            }
	        }
	        if (i==a) {
	            count++;
	        }
	    }
	    System.out.println(a);
	}