#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, ans=0, cnt=0;
    cin >> N;
    vector<ll> A(N);
    string S = "";
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<N-1; i++){
        if (A[i] < A[i+1]) S += '<';
        else S += '>';
    }

    for (int i=0; i<N-1; i++){
        if (S[i] == '<') cnt++;
        else ans += cnt;
    }

    cout << ans << endl;
    
    return 0;
}