https://sebhastian.com/javascript-prime-number/

function solve(input) {
    input = input.filter(x => x !== "stop")
    let primeSum = 0;
    let nonPrimeSum = 0;
    let isPrime = true

    input.map(Number).reduce((a, v, i) => {
        // A positive integer that is greater than 1 and is not divisible without 
        // a remainder by any positive integer other than itself and 1.
        
        // Refactor with isPrime, 
        // (i === 2 && v % i === 0)
        //     ? (isPrime = false, nonPrimeSum += v)
        //     : (isPrime = true, primeSum += v)

        if (v < 0) console.log("Number is negative.") // refactor

        return a
    })

    console.log(`Sum of all prime numbers is: ${primeSum}`)
    console.log(`Sum of all non prime numbers is: ${nonPrimeSum}`)

    function isPrime(num) {
        for (var i = 2; i < num; i++)
            if (num % i === 0) return false;
        return num > 1;
    }
}