#include <stdio.h>
#include<math.h>
 
int is_prime(int n){
	for (int i 
= 2; i 
<= sqrt(n
); ++i
) 		if((n%i) ==0)
			return 0;
	return 1;
}
int nth_prime(int n){
	int c=2;
	int i=0;
	while(i<n)
	{
		if(is_prime(c))
			++i;
		++c;
	}
	return c-1;
}
int main(int argc, char const *argv[])
{
	int n;
	printf("please give a value for n"); 	printf("the %dth prime is: %d",n
,nth_prime
(n
)); 	return 0;
}
				I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlPG1hdGguaD4KCmludCBpc19wcmltZShpbnQgbil7Cglmb3IgKGludCBpID0gMjsgaSA8PSBzcXJ0KG4pOyArK2kpCgkJaWYoKG4laSkgPT0wKQoJCQlyZXR1cm4gMDsKCXJldHVybiAxOwp9CmludCBudGhfcHJpbWUoaW50IG4pewoJaW50IGM9MjsKCWludCBpPTA7Cgl3aGlsZShpPG4pCgl7CgkJaWYoaXNfcHJpbWUoYykpCgkJCSsraTsKCQkrK2M7Cgl9CglyZXR1cm4gYy0xOwp9CmludCBtYWluKGludCBhcmdjLCBjaGFyIGNvbnN0ICphcmd2W10pCnsKCWludCBuOwoJcHJpbnRmKCJwbGVhc2UgZ2l2ZSBhIHZhbHVlIGZvciBuIik7CglzY2FuZigiJWQiLCZuKTsKCXByaW50ZigidGhlICVkdGggcHJpbWUgaXM6ICVkIixuLG50aF9wcmltZShuKSk7CglyZXR1cm4gMDsKfQ==