#include using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define INF ((1LL<<62)-(1LL<<31)) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() typedef long long ll; typedef pair pl; //const ll mod=1000000007; int main() { int n; cin >> n; vector a(n),pos(n); rep(i,n) { cin >> a[i]; a[i]--; } rep(i,n) pos[a[i]]=i+1; ll res=0,sum=n*(n+1)/2; for(int i=n-1;i>=0;i--) { res=max(res,sum-pos[i]*2); sum-=pos[i]; } cout << res << endl; return 0; }