FindNthPrime

import math

def is_prime(n):
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

def find_nth_prime(num):
    if num <= 2:
        return -1
    
    primes = []
    
    i = 2
    while(len(primes) < num):
        if is_prime(i):
            primes.append(i)
        i += 1
    
    return primes[-1]
    
print(find_nth_prime(10001))