Oath of the Night's Watch

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

Given strengths $a_1,\ldots,a_n$. A person is selected if there is at least one strictly weaker person and at least one strictly stronger person.

Let $L=\min_i a_i$ and $R=\max_i a_i$. Count the elements satisfying $L<a_i<R$.

Input

• Line 1: integer $n$.
• Line 2: $n$ strengths.

Output

Print the count.

Subtask

Subtask 1 (100 points): $1\le n\le10^5$; $0\le a_i\le10^9$.

Example

Input

3
1 2 5

Output

1

Explanation

Only $2$ lies strictly between $1$ and $5$.