OddEvenSequence

package exam27April;

import java.util.Scanner;

public class LOngestOddEven {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        String raw_no_space = input.nextLine().replace(" ", "");

        String[] container = raw_no_space.split("[()]");

        int[] numbers = new int[container.length/2];

        int counter = 0;
        for (int i = 0; i < container.length; i++) {
            if (i % 2 == 1) {
                numbers[counter] = Integer.parseInt(container[i]);
                counter++;
            }
        }
        int longest = 1;

        int temp = 1;
        for (int i = 1; i < numbers.length; i++) {
            int sum = numbers[i]+ numbers[i-1];

            if (sum < 0) {
                sum = -sum;
            }
            if ((sum % 2 == 1) || numbers[i] == 0 ) {
                temp++;
                if(numbers[i] == 0 ) {
                    i++;
                    temp++;
                }
            }
            else {
                if (temp > longest) {
                    longest = temp;
                    temp = 1;
                }
            }
        }
        if (temp > longest) {
            longest = temp;
        }

        System.out.print(longest);
    }

}