#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
const int mod = 1000000007;
const long long INF = 1LL << 60;
using ll = long long;

int main()
{
  int N;
  cin >> N;
  
  if(N==1){
    cout << 0 << endl;
    return 0;
  }
  int ans=0;
  vector<int> a(N);
  rep(i,N){
    cin >> a[i];
    if(a[i]==N){
      ans=max(N*(N+1)/2-(i+1)*2,N*(N+1)-(i+1)-1);
    }
  }
  
  cout << ans << endl;
}