#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}


// sparse_table {{{
template <class Monoid>
class sparse_table {
  public:
    using value_type = typename Monoid::value_type;
  private:
    size_t len;
    vector<vector<value_type>> data;
  public:
    sparse_table(vector<value_type> const& v): len(v.size()), data(len) {
      for (auto i = 0; i < len; i++)
        data[i].push_back(v[i]);
      for (auto j = 1; (1 << j) <= len; j++) {
        for (auto i = 0; i < len; i++) {
          if (i + (1 << j) > len) break;
          data[i].push_back(
              Monoid::product(data[i][j - 1], data[i + (1 << (j - 1))][j - 1]));
        }
      }
    }
    value_type query(int left, int right) {
      int width = right - left, w = 0;
      while ((1 << (w + 1)) <= width) w++;
      value_type ans = Monoid::identity;
      int pos = left;
      for (int i = 0; (1 << i) <= width; i++) {
        int w = 1 << i;
        if (!(w & width)) continue;
        ans = Monoid::product(ans, data[pos][i]);
        pos += w;
      }
      return ans;
    }
};
// }}}

struct min_z {
  using value_type = Z;
  static constexpr Z identity = INF;
  static inline constexpr Z product(Z a, Z b) {
    return min(a, b);
  }
};

template <class T, class F>
T boundary(F is_ok, T ok, T ng) {
  while (abs(ok - ng) > 1) {
    T m = (ok + ng) / 2;
    (is_ok(m) ? ok : ng) = m;
  }
  return ok;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N;
  cin >> N;
  vector<Z> as(N + 2, -INF);
  for (auto i = 1; i <= N; i++)
    cin >> ix(as, i);
  sparse_table<min_z> st(as);
  Z ans = 0;
  for (auto i = 1; i <= N; i++) {
    Z left = boundary<Z>([&] (Z j) { return st.query(j, i + 1) == ix(as, i); }, i, 0);
    Z right = boundary<Z>([&] (Z j) { return st.query(i, j) == ix(as, i); }, i + 1, N + 2);
    dump(i);
    dump(left);
    dump(right);
    Z d = ix(as, i) * (i - left + 1) * (right - i);
    dump(d);
    ans += d;
  }
  cout << ans << endl;
}



Measured memory_bytes: 52480