题解 | #查找组成一个偶数最接近的两个素数#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void async function () {
    const n = parseInt(await readline());
    const isPrime = (num) => {
        const sqrtNum = Math.floor(Math.sqrt(num))+1;
        for(let i = 2; i < sqrtNum; i++){
            if(num % i === 0) return false;
        }
        return num != 1;
    }
    let left = right = n/2;
    while(!isPrime(left) || !isPrime(right)) left-- && right++;
    console.log(left)
    console.log(right)
}()