#import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
import math
import bisect
import heapq
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e20)
mod = int(1e9+7)
import itertools
def permutation_all(seq, choice):
    return list(itertools.permutations(seq, choice))

n = int(input())
p = lmp()
if n <= 3:
    ans = 0
    a = permutation_all([i for i in range(1,n+1)], n)
    for i in range(len(a)):
        cnt = 0
        for j in range(n):
            if p[j] < a[i][j]:cnt += j+1
            else:cnt -= j+1
        ans = max(ans,cnt)
    print(ans)
else:
    u = p.index(n)+1
    print(n*(n+1)//2-2*u)