primes = {
let n = 1e5;
let candidates = (new Array(n)).fill(true);
candidates[0] = candidates[1] = false;
for (let i = 2; i < Math.sqrt(n); i++) {
if (!candidates[i]) continue;
for (let j = i + i; j < n; j += i) candidates[j] = false;
}
return candidates
.map((x, i) => x ? i : false)
.filter(x => x);
}