import sys
from collections import defaultdict

def main():
    sys.setrecursionlimit(1 << 25)
    n, *rest = list(map(int, sys.stdin.read().split()))
    A = rest[:n]
    
    class FenwickTree:
        def __init__(self, size):
            self.size = size
            self.tree = [0] * (self.size + 2)
        
        def update(self, index, delta=1):
            while index <= self.size:
                self.tree[index] += delta
                index += index & -index
        
        def query(self, index):
            res = 0
            while index > 0:
                res += self.tree[index]
                index -= index & -index
            return res
    
    max_A = max(A) if A else 0
    freq = defaultdict(list)
    for idx, num in enumerate(A):
        freq[num].append(idx)
    
    total = 0
    
    for x in freq:
        cnt = [0] * (n + 1)
        for i in range(1, n + 1):
            cnt[i] = cnt[i - 1] + (1 if A[i - 1] == x else 0)
        
        s = [0] * (n + 1)
        for i in range(n + 1):
            s[i] = 2 * cnt[i] - i
        
        min_s = min(s)
        max_s = max(s)
        ft_size = max_s - min_s + 2
        ft = FenwickTree(ft_size)
        ft.update(s[0] - min_s + 1)
        res = 0
        
        for j in range(1, n + 1):
            target = s[j] - 1 - min_s + 1
            if target <= 0:
                count = 0
            else:
                count = ft.query(target)
            res += count
            ft.update(s[j] - min_s + 1)
        
        total += res
    
    print(total)

if __name__ == '__main__':
    main()