03. Sum Prime Non Prime

function isSimple(input) {
  let summPrime = 0;
  let summNonPrime = 0;

  let currentNumber = 0;

  let nonPrimeFlag = 0;

  //цикл перебирает числа из массива, одно за другим
  for (let i = 0; i < input.length - 1; i++) {
    nonPrimeFlag = 0;

    if (currentNumber == "stop") {
      return;
    }

    currentNumber = Number(input[i]);

    if (currentNumber === 1 || currentNumber === 0) {
      continue;
    }

    if (currentNumber < 0) {
      console.log("Number is negative.");
      continue;
    }

    if (currentNumber === 2) {
      summPrime = summPrime + 2;
      continue;
    }

    //пытаемся поделить текущее число на все числа от нуля до текущего числа

    for (let j = 2; j < currentNumber; j++) {
      if (currentNumber % j === 0) {
        summNonPrime = summNonPrime + currentNumber;
        nonPrimeFlag = 1;
        break;
      }
    }
    if (!nonPrimeFlag) {
      summPrime = Number(summPrime) + Number(currentNumber);
    }
  }
  console.log(`Sum of all prime numbers is: ${summPrime}`);
  console.log(`Sum of all non prime numbers is: ${summNonPrime}`);
}