Strictly in the Middle

Difficulty: 900 3000 ms 128 MB

implementation

Count the elements that are strictly greater than the minimum AND strictly smaller than the maximum.

Input: the first line has N; the second line has N integers.

Output: the count of strictly-interior values.

Constraints:

• 1 ≤ N ≤ 10⁵
• |a_i| ≤ 10⁹

Sample Tests

5
1 2 2 3 3

2

3
7 7 7

0

Read the Editorial