Aron has just received N bags of candies (each contains Ci candies) from his uncle. Being born in a strict family, Aron was taught by her mother to always share his present with his younger sister, Udrey. Aron does not dare to disobey her mother, but he also knows that Udrey doesn't really like candy; besides, Aron loooves candy.
Aron comes up with a brilliant solution: give one bag of candies with the least number of candies to Udrey. By doing this, Aron will get the most possible total number of candies, while his mother will think that Aron is a nice boy.
Your task is to compute the total number of candies Aron can get with his brilliant solution.
Input begins with one integers: N (1 ≤ N ≤ 1,000) denoting the number of bags. The next line contains N integers: Ci (1 ≤ Ci ≤ 100) denoting the number of candies in the ith bag.
Output in a line an integer representing the output for the given input.
|Aron gives bag with 1 candy to Udrey. The remaining bags have 5 + 2 + 3 + 4 = 14 candies.|
|Those three bags have the same number of candies. Aron gives one to Udrey, and he still has two with the total of 10 + 10 = 20 candies.|
End of Problem