#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)

int main(){
    ll n;
    cin >> n;
    ll ans = 0;
    if (n == 1){
        cout << 0 << endl;
        return 0;
    }
    map<int,int> mp;
    rep(i,n){
        ll x;
        cin >> x;
        mp[int(x)] = i+1; 
    }
    ll sum = n*(n+1)/2;
    for (int i = n;i >= 1;i--){
        ans = max(sum - 2*mp[i],ans);
        sum -= mp[i];
    }

    cout << ans << endl;

    return 0;
}