One day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.

Find the following:

<image>

Constraints

* 1 ≦ N ≦ 200,000
* (a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).

Input

The input is given from Standard Input in the following format:


N
a_1 a_2 ... a_N


Output

Print the answer.

Note that the answer may not fit into a 32-bit integer.

Examples

Input

3
2 1 3


Output

9


Input

4
1 3 2 4


Output

19


Input

8
5 4 8 1 2 6 7 3


Output

85
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int[] a = new int[N];
		int[] rev = new int[N+1];
		for(int i=0; i<N; i++) {
			a[i] = sc.nextInt();
			rev[a[i]] = i;
		}
		
		long ans = 0;
		
		TreeSet<Integer> sorted = new TreeSet<>();
		sorted.add(-1);
		sorted.add(N);
		
		for(int i=1; i<=N; i++) {
			int l = sorted.lower(rev[i]);
			int r = sorted.higher(rev[i]);
			ans += (long)i*(rev[i]-l)*(r-rev[i]);
			sorted.add(rev[i]);
		}
		
		System.out.println(ans);
		sc.close();
	}
}
