N = int(input())
P = list(map(int,input().split()))

if len(P) == 1:
  print(0)
  exit()

A = [(P[i],i+1) for i in range(N)]
A.sort(reverse=True)
ac_A = [A[0][1]]

for i in range(1,N):
  ac_A.append(ac_A[-1]+A[i][1])

ans = N*(N+1)//2
num = 2*A[0][1]

for i in range(1,N):
  num = min(num,ac_A[i-1]+2*A[i][1])

ans = max(0,ans-num)
print(ans)