import bisect
from collections import defaultdict

def main():
    import sys
    input = sys.stdin.read().split()
    n = int(input[0])
    A = list(map(int, input[1:n+1]))
    
    pos_dict = defaultdict(list)
    for idx, num in enumerate(A):
        pos_dict[num].append(idx)
    
    total = 0
    
    for x in pos_dict:
        positions = pos_dict[x]
        k = len(positions)
        if k == 0:
            continue
        
        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]
        
        s_list = list(prefix)
        sorted_s = sorted(set(s_list))
        rank = {v: i+1 for i, v in enumerate(sorted_s)}
        size = len(sorted_s)
        
        fenwick = [0] * (size + 2)
        
        def update(idx, val):
            while idx <= size:
                fenwick[idx] += val
                idx += idx & -idx
        
        def query(idx):
            res = 0
            while idx > 0:
                res += fenwick[idx]
                idx -= idx & -idx
            return res
        
        s0 = s_list[0]
        r0 = rank[s0]
        update(r0, 1)
        current = 0
        
        for i in range(1, n+1):
            s = prefix[i]
            pos = bisect.bisect_left(sorted_s, s)
            cnt = query(pos)
            current += cnt
            r = rank[s]
            update(r, 1)
        
        total += current
    
    print(total)

if __name__ == "__main__":
    main()