- Time limit: 1.00 s
- Memory limit: 512 MB
You must process the cubes in the given order. You can always either place the cube on top of an existing tower, or begin a new tower. What is the minimum possible number of towers?
Input
The first input line contains an integer $n$: the number of cubes.
The next line contains $n$ integers $k_1,k_2,\ldots,k_n$: the sizes of the cubes.
Output
Print one integer: the minimum number of towers.
Constraints
- $1 \le n \le 2 \cdot 10^5$
- $1 \le k_i \le 10^9$
Input:
5
3 8 2 1 5
Output:
2