Print Maximum Increasing Subsequence

import java.util.ArrayList;
import java.util.Scanner;

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

        String input = scanner.nextLine();
        String[] numbersAsString = input.split(" ");
        int[] numbers = new int[numbersAsString.length];
        ArrayList<Integer> temp = new ArrayList<>();
        int counter = 2;
        for (int i = 0; i < numbersAsString.length; i++) {
            numbers[i] = Integer.parseInt(numbersAsString[i]);
        }
        for (int i = 0; i < numbers.length - 2; i++) {

            if (numbers[i] < numbers[i+1] && numbers[i+1] < numbers[i+2]) {
                temp.add(numbers[i]);
                temp.add(numbers[i+1]);
                temp.add(numbers[i+2]);
                i +=2;
                counter +=2;
                if(numbers[i] < numbers[i+1]){
                    temp.add(numbers[i+1]);
                }
                break;
            }
            else{
                temp.clear();
            }
        }
        if(counter > 2){
            temp.clear();
        }
            for (int i = counter; i < numbers.length - 2; i++) {

                if (numbers[i] < numbers[i+1] && numbers[i+1] < numbers[i+2]) {
                    temp.add(numbers[i]);
                    temp.add(numbers[i+1]);
                    temp.add(numbers[i+2]);
                    i +=2;
                    if(numbers[i] < numbers[i+1]){
                        temp.add(numbers[i+1]);
                    }
                    break;
                }
        }
        for (int num : temp) {
            System.out.print(num + " ");
        }
    }
}