#include <vector>
#include <iostream>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
using namespace std;
int inc[102400];
int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	vector<vector<int> > G(N);
	for(int i = 0; i < N; ++i) {
		cin >> A[i];
		G[--A[i]].push_back(i);
		inc[i] = i;
	}
	long long ans = 1LL * N * (N + 1) / 2, cursum = ans - N;
	for(int i = 0; i < N; ++i) {
		int ini = 0;
		for(int j = 0; j <= G[i].size(); ++j) {
			int t = (j != G[i].size() ? G[i][j] : N);
			for(int k = ini; k < t; ++k) {
				if(inc[k] < t) {
					cursum += t - inc[k];
					inc[k] = t;
				}
				else break;
			}
			ini = t + 1;
		}
		ans += 1LL * N * N - cursum;
	}
	cout << ans << endl;
	return 0;
}