#include <bits/stdc++.h> using namespace std; int x,n,ans; stack<int>stk; int main() { cin>>n; for(int i=1;i<=n;i++) { 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--)s.push(x); } cout<<ans; return 0; }