#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-18;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {-1,1,0,0};
int dw[] = {0,0,1,-1};


int main(){
    int n; cin >> n;
    vector<Pi> p(n);
    rep(i,n){
        cin >> p[i].first;
        p[i].second = i;
    }

    sort(p.rbegin(),p.rend());

    ll ans = 0;
    vector<ll> sum(n+1);
    rep(i,n) sum[i+1] = sum[i]+p[i].second+1;
    repr(i,1,n){
        ll tmp = sum[n]-sum[i];
        tmp -= p[i-1].second+1;
        ans = max(ans,tmp);
    }
    cout << ans << endl;
}