#include <bits/stdc++.h>
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<ll,ll> pl;

//const ll mod=1000000007;

int main()
{
    int n;
    cin >> n;
    vector<ll> p(n),q(n);
    rep(i,n) {
        cin >> p[i];
        if(p[i]==n) q[i]=1;
        else q[i]=p[i]+1;
    }
    ll tot=0;
    rep(i,n) {
        if(p[i]<q[i]) tot+=i+1;
        else if(p[i]>q[i]) tot-=i+1;
    }
    ll ans=tot;
    sort(all(q));
    tot=0;
    rep(i,n) {
        if(p[i]<q[i]) tot+=i+1;
        else if(p[i]>q[i]) tot-=i+1;
    }
    ans=max(ans,tot);
    cout << ans << endl;
    return 0;
}