eolymp
bolt
Try our new interface for solving problems
Problems

Sum without maximum

Sum without maximum

Time limit 1 second
Memory limit 128 MiB

The array of n integers is given. Find the sum of all array elements that are not equal to the maximum.

Input data

The first line contains the number n~(n \le 100). The next line contains n integers, each of which does not exceed 100 in absolute value.

Output data

Print the sum of all the array elements that are not equal to the maximum.

Examples

Input example #1
6
5 9 3 4 6 9
Output example #1
18