function solve(input) {


    let index = 0;

    let primeSum = 0;

    let nonPrimeSum = 0;







    while (input[index] !== 'stop') {

        let currentNumber = Number(input[index]);

        if (currentNumber < 0) {

            console.log(`Number is negative.`);

        } else {



            let isPrime = true;

            for (let i = 2; i < currentNumber; i++) {



                if (currentNumber % i === 0) {

                    isPrime = false;

                    break;

                }





            }


            if (isPrime) {

                primeSum += currentNumber;

            } else {

                nonPrimeSum += currentNumber;

            }





        }

                index++;

            } // While loop


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

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


        }