#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<pair<int, int>> s;
int n, sum=0;
long input[80000];
cin >> n;
for (int i = 0 ; i < n ; i += 1) {
cin >> input[i];
}
for (int i = n-1; i >= 0 ; i -= 1 ) {
while (!s.empty() && s.top().second < input[i]) {
s.pop();
}
if (s.empty()) {
sum += n-1-i;
} else {
sum += s.top().first - i-1;
}
s.push(make_pair(i, input[i]));
}
cout << sum;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RhY2s+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXN0YWNrPHBhaXI8aW50LCBpbnQ+PiBzOwoJaW50IG4sIHN1bT0wOwoJbG9uZyBpbnB1dFs4MDAwMF07CgljaW4gPj4gbjsKCWZvciAoaW50IGkgPSAwIDsgaSA8IG4gOyBpICs9IDEpIHsKCQljaW4gPj4gaW5wdXRbaV07Cgl9Cglmb3IgKGludCBpID0gbi0xOyBpID49IDAgOyBpIC09IDEgKSB7CgkJd2hpbGUgKCFzLmVtcHR5KCkgJiYgcy50b3AoKS5zZWNvbmQgPCBpbnB1dFtpXSkgewoJCQlzLnBvcCgpOwoJCX0KCQlpZiAocy5lbXB0eSgpKSB7CgkJCXN1bSArPSBuLTEtaTsKCQl9IGVsc2UgewoJCQlzdW0gKz0gcy50b3AoKS5maXJzdCAtIGktMTsKCQl9CgkJcy5wdXNoKG1ha2VfcGFpcihpLCBpbnB1dFtpXSkpOwoJfQoJY291dCA8PCBzdW07CglyZXR1cm4gMDsKfQ==