from collections import defaultdict
import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    n = int(input[0])
    A = list(map(int, input[1:n+1]))
    
    freq = defaultdict(int)
    for num in A:
        freq[num] += 1
    
    total = 0
    
    for x in freq:
        B = []
        for num in A:
            if num == x:
                B.append(1)
            else:
                B.append(-1)
        
        prefix = [0] * (n + 1)
        for i in range(n):
            prefix[i+1] = prefix[i] + B[i]
        
        # Compress prefix sums
        sorted_prefix = sorted(prefix)
        unique = sorted(list(set(prefix)))
        rank = {v: i+1 for i, v in enumerate(unique)}
        
        max_rank = len(unique)
        fenwick = [0] * (max_rank + 2)
        
        current_sum = 0
        
        def update(pos):
            while pos <= max_rank:
                fenwick[pos] += 1
                pos += pos & -pos
        
        def query(pos):
            res = 0
            while pos > 0:
                res += fenwick[pos]
                pos -= pos & -pos
            return res
        
        ans = 0
        for s in prefix:
            r = rank[s]
            ans += query(r - 1)
            update(r)
        
        total += ans
    
    print(total)

if __name__ == "__main__":
    main()