Problem Description

Given an integer $n$ and an array of $n$ integers. You are allowed to perform the following operation any number of times: choose one element of the array and increase it by 1.

Determine the minimum number of such operations required for all elements of the array to become equal.

Input Format

In the first line, an integer $n$ is given - the number of elements in the array $(1 \le n \le 10^5)$ . In the second line, $n$ natural integers are recorded - the elements of the array. The values of the numbers do not exceed $10^9$ .

Output Format

Print the minimum number of such operations needed for all elements of the array to become the same.

Examples

Example 1

Input

2
1 9

Output

Example 2