#include<iostream>
#include<set>
using namespace std;
using ll = long long;

int Q[200500];

int main() {
	set<int>s;
	int  n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		Q[x] = i;
	}
	s.insert(-1);
	s.insert(n);
	ll ans = 0;
	for (int v = 1; v <= n; v++) {
		int p = Q[v];//v番目の数
		auto it = s.upper_bound(p);
		int r = *it;
		int l = *(--it);
		ans += v * 1ll * (r - p) * 1ll * (p - l);
		s.insert(p);
	}
	cout << ans << endl;
}