First books

Execution time limit is 1 second

Runtime memory usage limit is 256 megabytes

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.

Input

The first line contains 5 integers — $a_{1}, a_{2}, a_{3}, a_{4}, a_{5}$ ( $1 \leq a_{1}, a_{2}, a_{3}, a_{4}, a_{5} \leq 1 0^{6}$ ) — the interestingness of the books.

Output

Output a single integer — the answer to the problem.

Examples

Input #1

Answer #1

Input #2

Answer #2

Input #3

Answer #3