Given N space separated integers. Your task is to arrange them such that the summation M of the absolute differences between every two adjacent numbers is maximum.

Input:

First line of the input contains an integer N.
Second line contains N space separated integers \(A_i\).

Output:

Print the above described M.

Constraints:

• \(1 \le N \le 1000\).
• \(1 \le A_i \le 10^{5}\).