#include <iostream> #include <stack> #define ll long long using namespace std; stack <ll> s; int main() { ll x, n, ans = 0; cin >> n; for(ll i = 1; i <= n; i++) { cin >> x; ll t = 1; while(s.size() && x >= s.top()) { if (s.top() == x) t++; ans++; s.pop(); } if(s.size()) ans++; for(ll j = 1; j <= t; j++) s.push(x); } cout << ans << endl; return 0; }