```
# importing_port
from math import ceil # look up python docs
from itertools import compress # kinda works like "".join()
# defining_port
def sieve(limit):
if limit < 2:
return []
limit += 1 # Pre-increment `limit` so sieve is inclusive, unlike `range`.
primes = [True]*limit # declaring every element [TRUE]
for base in range(2, int(limit**0.5 + 1)):
if primes[base]: # vv declaring multiples of prime numbers as [FALSE] vv
primes[base*2:limit:base] = [False]*(ceil(limit / base) - 2)
primes[0] = primes[1] = False
return compress(range(limit), primes)
# main_port
prime_list = list(sieve(15485863))
repeat = int(input())
for i in range(repeat):
n = int(input())
if n in prime_list:
print(n,"is a prime number.")
else:
print(n,"is not a prime number.")
```

this code of mine, gets stuck on the 6th case, can anyone please explainâĻ