#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn =  + ;

int n;

vector<int>a[maxn];

int limit;   //出现过的最大值

int main()

{

    scanf("%d", &n);

    for(int i = ;i <= n;i++)

    {

        int tmp;

        scanf("%d", &tmp);

        a[tmp].push_back(i);

        if(tmp > limit)  limit = tmp;

    }

    ll ans = ;

    for(int i = ;i <= n;i++)  ans += 1LL * (n +  - i) * i;  //总贡献

    for(int i = ;i <= limit;i++)

    {

        int pre = a[i][];

        for(int j = ;j < a[i].size();j++)

        {

            if(pre == )  ans -= (n - a[i][j] + );

            else if(a[i][j] == n)  ans -= pre;

            else  ans -= (1LL * pre * (n - a[i][j] + ));

            pre = a[i][j];

        }

    }

    printf("%lld\n", ans);

    return ;

}