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.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();
		int[] a = sc.nextIntList(N);
		int[] idx = new int[N + 1];

		SegmentTreeRMQ st = new SegmentTreeRMQ(N);
		for (int i = 0; i < N; i++) {
			st.update(i, a[i]);
			idx[a[i]] = i;
		}

		long ret = calc(idx, st, 0, N);
		System.out.println(ret);
	}

	private static long calc(int[] idx, SegmentTreeRMQ st, int left, int right) {
		if (left == right) {
			return 0;
		}

		int min = st.min(left, right);
		int i = idx[min];
		long ret = (long) min * (right - i) * (i - left + 1);
		ret += calc(idx, st, i + 1, right);
		ret += calc(idx, st, left, i);
		return ret;
	}
}

class SegmentTreeRMQ {
	public int M, H, N;
	public int[] st;

	public SegmentTreeRMQ(int n) {
		N = n;
		M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
		H = M >>> 1;
		st = new int[M];
		Arrays.fill(st, 0, M, Integer.MAX_VALUE);
	}

	public SegmentTreeRMQ(int[] a) {
		N = a.length;
		M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
		H = M >>> 1;
		st = new int[M];
		for (int i = 0; i < N; i++) {
			st[H + i] = a[i];
		}
		Arrays.fill(st, H + N, M, Integer.MAX_VALUE);
		for (int i = H - 1; i >= 1; i--)
			propagate(i);
	}

	public void update(int pos, int x) {
		st[H + pos] = x;
		for (int i = (H + pos) >>> 1; i >= 1; i >>>= 1)
			propagate(i);
	}

	private void propagate(int i) {
		st[i] = Math.min(st[2 * i], st[2 * i + 1]);
	}

	public int min(int l, int r) {
		return l >= r ? 0 : min(l, r, 0, H, 1);
	}

	private int min(int l, int r, int cl, int cr, int cur) {
		if (l <= cl && cr <= r) {
			return st[cur];
		} else {
			int mid = cl + cr >>> 1;
			int ret = Integer.MAX_VALUE;
			if (cl < r && l < mid) {
				ret = Math.min(ret, min(l, r, cl, mid, 2 * cur));
			}
			if (mid < r && l < cr) {
				ret = Math.min(ret, min(l, r, mid, cr, 2 * cur + 1));
			}
			return ret;
		}
	}

}

class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}