该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Background

Welcome to XJS Round 3 - Div3! In this contest, you will embark on an adventure with the young boy Muxue and help him solve a series of problems. This contest is jointly hosted by XJSOJ & XieMa Coduck (MarsOJ) , and this is the main venue.

Problem Description

Muxue has an integer array of length $n$. He wants to make all elements in the array equal with the minimum number of operations. The only operation allowed is: choose any element in the array and increase its value by 1.

Muxue would like to know the minimum number of such operations required to make all elements in the array equal. Note that he can only increase the values of the elements, not decrease them.

Please write a program to help Muxue solve this problem.

Input Format

• The first line contains an integer $n (1 \leqslant n \leqslant 10^5)$, the length of the array.
• The second line contains $n$ integers $a_1, a_2, \cdots, a_n (1 \leqslant a_i \leqslant 10^9)$, the elements of the array.

Output Format

A single integer, representing the minimum number of operations required to make all elements equal.

Sample Input/Output #1

Input #1

5
1 2 3 4 5

Output #1

10

Sample Input/Output #2

Input #2

3
5 5 5

Output #2

0

Explanation

Explanation of Sample 1: Changing all elements to 5 requires $0+1+2+3+4=10$ operations.

This problem uses Subtask bundled testing.

Subtask 1 (25 points): $1 \leq n \leq 30$.

Subtask 2 (25 points): $1 \leq n \leq 100$.

Subtask 3 (25 points): $1 \leq n \leq 10000$.

Subtask 4 (25 points): $1 \leq n \leq 100000$.