#include <bits/stdc++.h> using namespace std; int x,n,ans; stack<int>stk; int main() { cin>>n; while (n--) { cin>>x; int t=1; while (stk.size() && x>=stk.top()) { if (stk.top()==x) t++; ans++; stk.pop(); } if(stk.size()) ans++; while(t--) stk.push(x); } cout<<ans; return 0; }