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



                if (currentNumber % i === 0) {

                    isPrime = false;

                    break;

                }





            }


            if (isPrime) {

                primeSum += currentNumber;

            } else {

                nonPrimeSum += currentNumber;

            }

            isPrime = true;