Giup minh lam not cai bai tap Python nay voi :D

from math import sqrt
def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True
n = int(input("Input number: "))
i = 2
print("Frist",n,"prime(s) :","",end="")
while n > 0:
    if is_prime(i):
        print(i,end=" ")
        n = n - 1
    i = i + 1

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

n=int(input("Input number: "))
i=2
print(f'First {n} prime(s): ',end=' ')
while n!=0:
  if is_prime(i):
    print(i,end=' ')
    n-=1
  i+=1