Time Limit: 10000 MS    Memory Limit: 65536 K 


Description

Mirko discovered what Slavko did in previous task, and decided to deal with something completely opposite to tables of letters: sequences of numbers. Lets define a value of a sequence as the difference between the largest and the smallest number within that sequence. For example, value of sequence (3, 1, 7, 2) is 6, and value of (42, 42) is 0. Find the sum of values of all subsequences of consecutive elements of a given sequence.

Input

The first line of input contains a single integer N (2 N 300 000), number of elements of the sequence. Next N lines contain elements of the sequence. Each element is a positive integer not greater than 100 000 000.

Output

The first and only line of output must contain the requested sum.

Sample Input

3 1 2 3 4 7 5 7 5 4 3 1 7 2

Sample Output

4 12 31

Source

coci 2010/2011 contest3