#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
using namespace std ;
 
#define MAX 100001
 
int N,arr[MAX] ;
stack<int> S;
 
int main(){
 
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
		scanf("%d",&arr[i]);
	reverse(arr+1,arr+1+N);
	long long ans = 0;
	for(int i=1;i<=N;i++){
		while(!S.empty() && arr[S.top()] < arr[i])
			S.pop();
		ans = ans + (S.empty() ? i-1 : i-S.top()-1);
		S.push(i);
	}	
	printf("%lld\n",ans);
	return 0 ;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c3RhY2s+CnVzaW5nIG5hbWVzcGFjZSBzdGQgOwoKI2RlZmluZSBNQVggMTAwMDAxCgppbnQgTixhcnJbTUFYXSA7CnN0YWNrPGludD4gUzsKCmludCBtYWluKCl7CgkKCXNjYW5mKCIlZCIsJk4pOwoJZm9yKGludCBpPTE7aTw9TjtpKyspCgkJc2NhbmYoIiVkIiwmYXJyW2ldKTsKCXJldmVyc2UoYXJyKzEsYXJyKzErTik7Cglsb25nIGxvbmcgYW5zID0gMDsKCWZvcihpbnQgaT0xO2k8PU47aSsrKXsKCQl3aGlsZSghUy5lbXB0eSgpICYmIGFycltTLnRvcCgpXSA8IGFycltpXSkKCQkJUy5wb3AoKTsKCQlhbnMgPSBhbnMgKyAoUy5lbXB0eSgpID8gaS0xIDogaS1TLnRvcCgpLTEpOwoJCVMucHVzaChpKTsKCX0JCglwcmludGYoIiVsbGRcbiIsYW5zKTsKCXJldHVybiAwIDsKfQ==

NgoxMAozCjcKNAoxMgoy

6
10
3
7
4
12
2