/* -*- coding: utf-8 -*-
 *
 * 1525.cc:  No.1525 Meximum Sum - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;

/* global variables */

int ks[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);
    ks[ai] = i;
  }

  ll sum = 0;
  int l = n + 1, r = -1;
  for (int i = 0; i < n; i++) {
    l = min(l, ks[i]);
    r = max(r, ks[i] + 1);
    sum += (ll)(l + 1) * (n - r + 1);
  }

  printf("%lld\n", sum);
  return 0;
}