Codeforces Round #392(Div. 2) A Holiday Of Equality【水题】

A. Holiday Of Equality

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury.

Totally in Berland there are n citizens, the welfare of each of them is estimated as the integer in a_i burles (burle is the currency in Berland).

You are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.

Input

The first line contains the integer n (1 ≤ n ≤ 100) — the number of citizens in the kingdom.

The second line contains n integers a₁, a₂, ..., a_n, where a_i (0 ≤ a_i ≤ 10⁶) — the welfare of the i-th citizen.

Output

In the only line print the integer S — the minimum number of burles which are had to spend.

Examples

Input

5
0 1 2 3 4

Output

10

Input

5
1 1 0 1 1

Output

1

Input

3
1 3 1

Output

4

Input

1
12

Output

0

Note

In the first example if we add to the first citizen 4 burles, to the second 3, to the third 2 and to the fourth 1, then the welfare of all citizens will equal 4.

In the second example it is enough to give one burle to the third citizen.

In the third example it is necessary to give two burles to the first and the third citizens to make the welfare of citizens equal 3.

In the fourth example it is possible to give nothing to everyone because all citizens have 12 burles.

题目大意：

一共给你N个数，让你向上补数值，使得最终所有数值都相等，输出最少花费。

思路：

要补上的最少，那么肯定是都将数字都改变成最大的即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int n ;
int a[15000];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
        }
        int maxn=0;
        for(int i = 1; i<=n; i++ )
        {
            maxn=max(maxn,a[i]);
        }
        int ans = 0;
        for(int i=1; i<=n; i++)
        {
            ans+=(maxn-a[i]);
        }
        printf("%d\n",ans);
    }
}