#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<int> p(n);
    for (int i = 0; i < n; ++i) {
        int x;
        scanf("%d", &x);
        p[x] = i;
    }
    int l = INF<int>, r = -INF<int>;
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        l = min(l, p[i]);
        r = max(r, p[i]);
        ans += (ll)(l+1)*(n-r);
    }
    cout << ans << "\n";
    return 0;
}