You, as an experienced participant in programming olympiads, decided to spread the love for this activity and encourage your friend to participate in them by giving him 5 programming books. The books have interestingness values a_1, a_2, a_3, a_4, and a_5 respectively. But if it were that simple, your friend becomes accustomed to the interestingness of the books. Therefore, if the reading order is 1,2,3,4,5, then he will be interested in a_1 + \max(0,a_2-a_1) + \max(0,a_3-a_2) + \max(0,a_4-a_3) + \max(0,a_5-a_4). You can change the order of reading the books. Find the maximum value of your friend's interest among all possible orders of reading the books.
The first line contains 5 integers — a_1, a_2, a_3, a_4, a_5 (1 \le a_1, a_2, a_3, a_4, a_5 \le 10^6) — the interestingness of the books.
Output a single integer — the answer to the problem.
Example 1
Example 2
Example 3