class BIT: def __init__(self, n): self.n = n self.bit = [0]*(self.n+1) # 1-indexed def init(self, init_val): for i, v in enumerate(init_val): self.add(i, v) def add(self, i, x): # i: 0-indexed i += 1 # to 1-indexed while i <= self.n: self.bit[i] += x i += (i & -i) def sum(self, i, j): # return sum of [i, j) # i, j: 0-indexed return self._sum(j) - self._sum(i) def _sum(self, i): # return sum of [0, i) # i: 0-indexed res = 0 while i > 0: res += self.bit[i] i -= i & (-i) return res def lower_bound(self, x): s = 0 pos = 0 depth = self.n.bit_length() v = 1 << depth for i in range(depth, -1, -1): k = pos + v if k <= self.n and s + self.bit[k] < x: s += self.bit[k] pos += v v >>= 1 return pos def __str__(self): # for debug arr = [self.sum(i,i+1) for i in range(self.n)] return str(arr) n = int(input()) P = list(map(int, input().split())) bit = BIT(n+5) for i in range(1, n+1): bit.add(i, 1) ans = 0 for i in reversed(range(n)): p = P[i] s = bit.sum(p+1, bit.n) if s == 0: if bit.sum(p, p+1) > 0: bit.add(p, -1) else: j = bit.lower_bound(1) if j != p: ans -= (i+1) bit.add(j, -1) else: ng = p+1 ok = bit.n while ng+1 < ok: c = (ng+ok)//2 if bit.sum(p+1, c) > 0: ok = c else: ng = c ans += i+1 bit.add(ok-1, -1) print(ans)