Larger Smaller

You are given an array $A$ of $N$ positive integers. An integer $X$ is said to be *good* if there exists indices $i$ and $j$ ($1 \le i, j \le N$) such that $A_i < X$ and $X < A_j$ (i.e. there exists a smaller element and a larger element). Find the number of *good* integers. It can be proven that the answer is always finite. ### Input - The first line of input will contain a single integer $T$