#!/usr/bin/python3

import math
from functools import cache


terraces = int(input())
line = input()
heights = [int(i) for i in line.split()]
total = 0
# unique_heights = list(sorted(set(heights)))

# finished_pairs = []
considered_pairs = []
total = 0

for idx, height in enumerate(heights):
    considered_pairs.append((idx, 0))
    to_pop = []

    for i2, p2 in enumerate(considered_pairs):
        if heights[p2[0]] < height:
            to_pop.append(i2)
        elif heights[p2[0]] == height and p2[1] != 0:
            # finished_pairs.append(p2)
            total += p2[1]-1
            to_pop.append(i2)
        else:
            considered_pairs[i2] = (p2[0], p2[1]+1)

    for idx in reversed(to_pop):
        considered_pairs.pop(idx)

# print(finished_pairs)


print(total)