function findNthPrime(n) {
let count = 0;
let num = 1;
function isPrime(number) {
if (number < 2) return false;
for (let i = 2; i <= Math.sqrt(number); i++) {
if (number % i === 0) return false;
}
return true;
}
while (count < n) {
num++;
if (isPrime(num)) {
count++;
}
}
return num;
}