#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define db double
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
	int n;cin>>n;
	vc<int>v(n); rep(i,n)cin>>v[i];
	vc<int>x(n-1);
	rep(i,n-1){
		if(v[i]<v[i+1])x[i]=1;
		else x[i]=0;
	}
	ll s=0;rep(i,n-1)s+=x[i];
	ll ans=0;
	rep(i,n-1)if(x[i]==1)ans+=n-2-i;
	ans-=s*(s-1)/2;
	cout<<ans;
}