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

using ll = long long;
using pll = pair<ll,ll>;

int main(){
	ll n; cin >> n;
	vector<pll> ar(n);
	for (int i = 0; i < n; i++){
		ll c; cin >> c;
	    ar[i] = pll(-c,ll(i+1));
	}
	sort(ar.begin(),ar.end());
	if (n == 1){
	    assert(ar[0].first == -1);
	    cout << 0 << endl;
	    return 0;
	}
	ll f = n * (n + 1) / 2;
	ll ima = 2 * ar[0].second;
	ll mi = ima;
	for (int i = 0; i < n-1; i++){
	    ima = ima - ar[i].second + 2 * ar[i+1].second;
	    if (i == n-2) ima -= ar[i+1].second;
	    mi = min(mi,ima);
	}
	for (int i = 0; i < n; i++){
	    assert(n+ar[i].first == i);
	}
	cout << f - mi << endl;
	return 0;
}