这道题该怎么做啊？感觉好复杂啊，你知道该怎么依次判断每个数是否为质数

from numpy.lib import math


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


i = 0
n = 2
limit = int(input())
while i < limit:
    if isPrime(n):
        i += 1
    n += 1
print(n-1)