#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<typename Monoid, typename OperatorMonoid=Monoid>
struct LazySegmentTree{
	using F=function<Monoid(Monoid, Monoid)>;
	using G=function<Monoid(Monoid, OperatorMonoid, int, int)>;
	using H=function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
	int sz;
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f;
	const G g;
	const H h;
	const Monoid e1;
	const OperatorMonoid e0;

	LazySegmentTree(int n, const F f, const G g, const H h, const Monoid &e1, const OperatorMonoid &e0): f(f), g(g), h(h), e1(e1), e0(e0){
		sz=1;
		while(sz<n) sz<<=1;
		data.resize(2*sz-1, e1);
		lazy.resize(2*sz-1, e0);
	}

	void build(vector<Monoid> v){
		for(int i=0; i<v.size(); i++) data[i+sz-1]=v[i];
		for(int i=sz-2; i>=0; i--) data[i]=f(data[2*i+1], data[2*i+2]);
	}

	void eval(int k, int l, int r){
		if(lazy[k]!=e0){
			data[k]=g(data[k], lazy[k], l, r);
			if(k<sz-1){
				lazy[2*k+1]=h(lazy[2*k+1], lazy[k]);
				lazy[2*k+2]=h(lazy[2*k+2], lazy[k]);
			}
		}
		lazy[k]=e0;
	}

	void update(int a, int b, const OperatorMonoid &x, int k, int l, int r){
		eval(k, l, r);
		if(r<=a || b<=l) return;
		if(a<=l && r<=b){
			lazy[k]=h(lazy[k], x);
			eval(k, l, r);
		}else{
			update(a, b, x, 2*k+1, l, (l+r)/2);
			update(a, b, x, 2*k+2, (l+r)/2, r);
			data[k]=f(data[2*k+1], data[2*k+2]);
		}
	}
	void update(int a, int b, const OperatorMonoid &x){
		return update(a, b, x, 0, 0, sz);
	}

	Monoid find(int a, int b, int k, int l, int r){
		eval(k, l, r);
		if(b<=l || r<=a) return e1;
		if(a<=l && r<=b) return data[k];
		else return f(find(a, b, 2*k+1, l, (l+r)/2), find(a, b, 2*k+2, (l+r)/2, r));
	}
	Monoid find(int a, int b){
		return find(a, b, 0, 0, sz);
	}
	Monoid operator[](const int &k){
		return find(k, k+1);
	}
};
int main()
{
    int n;
	cin>>n;
	int a[100010];
	for(int i=0; i<n; i++){
		cin>>a[i];
	}
	vector<int> v[100010];
	for(int i=0; i<n; i++){
		v[a[i]].push_back(i+1);
	}
	ll ans=0;
	auto f=[](P p, P q){
		return P(p.first+q.first, p.second+q.second);
	};
	auto g=[](P p, ll x, int l, int r){
		return P(p.first+x*((ll)r*(r-1)/2-(ll)l*(l-1)/2), p.second+x*(r-l));
	};
	auto h=[](ll x, ll y){ return x+y;};
	LazySegmentTree<P, ll> seg(2*n+1, f, g, h, P(0, 0), 0);
	for(int i=1; i<=100000; i++){
		if(v[i].empty()) continue;
		v[i].push_back(n+1);
		int s=n, pr=0;
		seg.update(n, n+1, 1);
		for(auto j:v[i]){
			P p1=seg.find(s-(j-pr-1)-1, s-1);
			ans+=-p1.first+p1.second*(s-1);
			ans+=(j-pr-1)*seg.find(0, s-(j-pr)).second;
			if(j==n+1) break;
			seg.update(s-(j-pr-1), s, 1);
			s=s-(j-pr-1)+1;
			ans+=seg.find(0, s).second;
			seg.update(s, s+1, 1);
			pr=j;
		}
		s=n, pr=0;
		seg.update(n, n+1, -1);
		for(auto j:v[i]){
			if(j==n+1) break;
			seg.update(s-(j-pr-1), s, -1);
			s=s-(j-pr-1)+1;
			seg.update(s, s+1, -1);
			pr=j;
		}
	}
	cout<<ans<<endl;
	return 0;
}