#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main(){
  int N;
  cin >> N;
  int A[N], id[N+1];
  for(int i = 0; i < N; ++i){
    cin >> A[i];
    id[A[i]] = i;
  }
  long long int ans = 0LL;
  set<int> S;
  S.insert(N);
  S.insert(-1);
  for(int i = 1; i <= N; ++i){
    S.insert(id[i]);
    set<int>::iterator itr = S.find(id[i]), l = itr, r = itr;
    --l;
    ++r;
    ans += (long long int)(id[i] - *l)*(*r - id[i])*i;
  }
  cout << ans << endl;
  return 0;
}
