Birthday Cake Candles

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem Statement

There are $n$ candles and candle $i$ has height $h_i$. Only candles whose height equals the maximum height are counted.

Let

Count the indices $i$ such that $h_i=H$.

Input

• The first line contains an integer $n$.
• The second line contains $n$ integers $h_0,h_1,\ldots,h_{n-1}$.

Output

Print one integer: the number of tallest candles.

Subtasks

Subtask 1 (100 points): $1\le n\le10^5$; $1\le h_i\le10^7$.

Examples

Input

4
3 2 1 3

Output

2

Explanation

The maximum height is $H=3$. Height $3$ occurs at indices $0$ and $3$, so there are exactly $2$ tallest candles.