#include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return 1;
  }
  return 0;
}

const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

void solve([[maybe_unused]] int CASE)
{
  int n;
  cin >> n;
  std::vector<int> p(n + 1);
  std::vector<ll> pos(n + 1);
  std::set<ll> s;
  for (int i = 1; i <= n; ++i)
  {
    cin >> p[i];
    pos[p[i]] = i;
    s.emplace(i);
  }
  ll res = 0;
  {
    for (int i = n; i >= 1; --i)
    {
      auto itr = s.upper_bound(p[i]);
      if (itr == s.end())
      {
        itr = s.find(p[i]);
        if (itr != s.end())
        {
          s.erase(itr);
        }
        else
        {
          res -= i;
          s.erase(s.begin());
        }
      }
      else
      {
        res += i;
        s.erase(itr);
      }
    }
  }
  {
    ll ans = 0;
    std::vector<ll> sum(n + 2);
    for (int i = 0; i <= n; ++i)
    {
      sum[i + 1] = sum[i] + pos[i];
    }
    for (int i = 1; i <= n; ++i)
    {
      ll t = -i + sum[p[i]];
      chmax(ans, t);
    }
    chmax(res, ans);
  }
  cout << res << "\n";
}

int main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int kkt = 1;
  // cin >> kkt;
  for (int jupi = 1; jupi <= kkt; jupi++)
    solve(jupi);
  return 0;
}