#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


int main(){
  int N; cin >> N;
  vector<int> A(N); rep(i,N) cin >> A[i];
  vector<int> P(N);
  rep(i,N) P[A[i]] = i;
  vector<int> L = P;
  vector<int> R = P;
  rep(i,N-1) L[i+1] = min(L[i],L[i+1]);
  rep(i,N-1) R[i+1] = max(R[i],R[i+1]);
  ll ans = 0;
  rep(i,N){
    ans += 1ll * (L[i]+1) * (N-R[i]);
  }
  cout << ans << "\n";
  return 0;
}



struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;