#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
const int mod = 1000000007;
const long long INF = 1LL << 60;
using ll = long long;

int main()
{
  int N;
  cin >> N;
  
  if(N==1){
    cout << 0 << endl;
    return 0;
  }
  vector<pair<int,int>> p(N);
  rep(i,N){
    cin >> p[i].first;
    p[i].second=i+1;
  }
  sort(all(p));
  reverse(all(p));

  ll ans=N*(N+1)/2-2*p[0].second;
  ll A=N*(N+1)/2-2*p[0].second;
  rep(i,N-1){
    A=A+p[i].second-2*p[i+1].second;
    ans=max(ans,A);
  }

  cout << max(ans,0LL) << endl;
}