03. Sum Prime Non Prime

import java.util.Scanner;

public class tests {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int SumPrimeNumbers = 0;
        int SumNonPrimeNumbers = 0;

        while (true) {
            String input = scan.nextLine();
            if (input.equals("stop")) {
                break;
            }

            boolean isPrime = true;
            int Number = Integer.parseInt(input);
            int SqrRoot = (int) Math.ceil(Math.sqrt(Number));
            if (Number < 0) {
                System.out.println("Number is negative.");
                continue;
            }
            for (int i = 2; i <= SqrRoot; i++) {
                if (Number % i == 0) {
                    isPrime = false;
                }
            }
            if (isPrime) {
                SumPrimeNumbers += Number;
            } else {
                SumNonPrimeNumbers += Number;
            }
        }
        System.out.println("Sum of all prime numbers is: " + SumPrimeNumbers);
        System.out.println("Sum of all non prime numbers is: " + SumNonPrimeNumbers);
    }
}