#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#include <atcoder/lazysegtree>

namespace RangeUpdateRangeSumMax {
using var = unsigned long long;
const var LOWEST = 0;
struct S {
    var sum, max;
    int size;
    static S init(var x) { return S{x, x, 1}; }
};
struct F {
    var _lazy;
    bool _updated;
    static F update(var x) noexcept { return {x, true}; }
};
S op(S l, S r) noexcept { return {l.sum + r.sum, l.max > r.max ? l.max : r.max, l.size + r.size}; }
S e() noexcept { return {var(), LOWEST, 0}; }
S mapping(F f, S x) noexcept { return f._updated ? S{x.size * f._lazy, x.size ? f._lazy : LOWEST, x.size} : x; }
F composition(F fnew, F gold) noexcept { return fnew._updated ? fnew : gold; }
F id() noexcept { return {var(), false}; }
using segtree = atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>;
} // namespace RangeUpdateRangeSumMax

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    unsigned N;
    cin >> N;
    vector<vector<unsigned>> v2is(N);
    for (unsigned i = 0; i < N; i++) {
        unsigned a;
        cin >> a;
        v2is[a - 1].push_back(i);
    }
    long long ret = 0;

    vector<RangeUpdateRangeSumMax::S> init(N);
    for (int i = 0; i < N; i++) init[i] = RangeUpdateRangeSumMax::S::init(i);
    RangeUpdateRangeSumMax::segtree tree(init);

    for (int h = 0; h < N; h++) {
        int l = 0;
        for (auto i : v2is[h]) {
            int r = tree.max_right(l, [&](auto x) { return x.max <= i; });
            if (l < r) tree.apply(l, r, RangeUpdateRangeSumMax::F::update(i));
            l = i + 1;
        }
        tree.apply(l, N, RangeUpdateRangeSumMax::F::update(N));
        auto tmp = (long long)N * N - tree.all_prod().sum;
        ret += tmp;
        if (!tmp) break;
    }
    cout << ret + (long long)N * (N + 1) / 2 << '\n';
}