#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];
  vector<int> p(N);
  for (int i = 0; i < N; ++i) p[A[i]] = i;
  long long ans = 0;
  int left = N, right = -1;
  for (int k = 0; k < N; ++k) {
    left = min(left, p[k]);
    right = max(right, p[k]);
    ans += (left + 1LL) * (N - right);
  }
  cout << ans << endl;
}