Poisonous Plants

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class PoisonousPlants {

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner in = new Scanner(System.in);

        int n = Integer.valueOf(in.nextLine().trim());

        List<Integer> garden = new ArrayList<>(n);

        {
            String[] flowers = in.nextLine().split("\\s+");

            if (!(flowers.length == 1 && flowers[0].length() == 0)) {
                for (String f : flowers) {
                    garden.add(Integer.parseInt(f));
                }
            }
        }

        boolean deadFlowers;
        long k = 0;

        do {
            deadFlowers = false;
            Queue<Integer> positionsQ = new ArrayDeque<>();

            for (int i = garden.size() - 1; i > 0; i--) {
                if (garden.get(i) > garden.get(i - 1)) {
                    positionsQ.add(i);
                }
            }

            while (positionsQ.size() > 0) {
                garden.remove(positionsQ.poll().intValue());
                deadFlowers = true;
            }
            if (deadFlowers)
                k++;

        } while (deadFlowers);

        System.out.println(k);
    }

}