#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define fi first
#define se second
#define N 1111111
ll n, a[N], pos[N], ans;
struct seg{
	ll l, r;
	ll rg(){
		return r - l + 1;
	}
	void upd(ll x, ll y){
		l = max(x, l), r = min(r, y);
	}
}l, r;
int main(){
	//freopen("mex.in", "r", stdin);
	//freopen("mex.out", "w", stdout);
	scanf("%lld", &n);
	for(int i = 0 ; i < n ; i++){
		scanf("%lld", &a[i]);
		pos[a[i]] = i;
	}
	l = r = {0, n - 1};
	//cerr << l.rg() << " " << r.rg() << "\n";
	for(int i = 0 ; i < n ; i++){
		//cerr << i << " " << pos[i] << "\n";
		l.upd(0, pos[i]);
		r.upd(pos[i], n - 1);
		ans += l.rg() * r.rg();
		//cerr << i << " " << pos[a[i]] << " " << l.r << " " << r.l << "\n";
	}
	printf("%lld", ans);
	return 0;
}