#include <bits/stdc++.h> using namespace std; const int N=10e6+10; int n,maxn; int wjj[N]; long long ans; int main() { scanf("%d%d",&n,&wjj[1]); maxn=wjj[1]; for(int i=2; i<=n; i++) { scanf("%d",&wjj[i]); if(wjj[i]>maxn) { maxn=max(wjj[i],maxn); continue; } maxn=max(wjj[i],maxn); for(int j=1; j<=i-1; j++) if(wjj[i]<wjj[j]) { ans+=i-j; break; } } printf("%lld\n",ans); return 0; }