#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  ll N; cin >> N;
  vector<ll> a(N);
  for (auto &x: a) cin >> x;
  map<ll, ll> index;
  for (int i = 0; i < N; i++) {
    index[a[i]] = i + 1;
  }
  ll ans = 0;
  ll sum = N * (N + 1) / 2;
  for (int i = N; i >= 1; i--) {
    ans = max(ans, sum - index[i] * 2);
    sum -= index[i];
  }
  cout << ans << endl;
  return 0;
}