How Many Maximums

From an array $A$ containing $N$ integers, you construct a binary string $S$ of length $(N - 1)$ as follows. For all $1 \le i \lt N$: - If $A_i < A_{i+1}$, then $S_i = 0$. - If $A_i > A_{i+1}$, then $S_i = 1$. Given the string $S$, determine the count of indices $i$ $(1 \le i \le N)$ such that it is possible for $A_i$ to be the **maximum** element of the array $A$. ### Input - The first line con