I. Stick Lengths
time limit per test
2 s
memory limit per test
256 megabytes
input
standard input
output
standard output

There are $$$n$$$ sticks with some lengths. Your task is to modify the sticks so that each stick has the same length.

You can either lengthen and shorten each stick. Both operations cost $$$x$$$ where $$$x$$$ is the difference between the new and original length.

What is the minimum total cost?

Input

The first input line contains an integer $$$n$$$: the number of sticks.

Then there are n integers: $$$p_1,p_2,\dots,p_n$$$: the lengths of the sticks.

Constraints:

  • $$$1 \le n \le 2 \cdot 10^5$$$
  • $$$1 \le p_i \le 10^9$$$
Output

Print one integer: the minimum total cost.

Example
Input
5
2 3 1 5 2
Output
5