function isPrime(n) {
if (n === 0 || n === 1) return false;
for (let i = 2; i <= Math.sqrt(n); i++) {
if (n % i === 0) return false;
}
return true;
}
function eratosthenesSieve(n) {
const arr = new Array(n);
for (let i = 2; i <= n; i++) arr[i] = i;
for (let i = 2; i <= n; i++) {
if (arr[i] === 0) continue;
for (let j = 2 + i; j <= n; j += i) arr[j] = 0;
}
return arr.filter((e) => e !== 0);
}