2025-09-16 21:12:07 +09:00

19 lines
415 B
Python

def isPrime(n: int) -> bool :
if n == 1 :
return False
if n == 2 or n == 3 :
return True
if n % 2 == 0 or n % 3 == 0 :
return False
for i in range(5,int(n**0.5)+1, 6) :
if n % i == 0 or n % (i+2) == 0 :
return False
return True
for _ in range(int(input())) :
n: int = int(input())
while not isPrime(n) :
n += 1
print(n)