n = int(input())
l = list(map(int,input().split()))
l.sort(reverse = True)

ans = 0

for i in range(len(l)):
    for j in range(i+1,len(l)):
        for k in range(j+1,len(l)):
            if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1

print(ans) n = int(input()) n int(input()) int input() input l = list(map(int,input().split())) l list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split l.sort(reverse = True) l.sort l sort reverse = True reverse True ans = 0 ans 0 for i in range(len(l)):
    for j in range(i+1,len(l)):
        for k in range(j+1,len(l)):
            if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1 i range(len(l)) range len(l) len l for j in range(i+1,len(l)):
        for k in range(j+1,len(l)):
            if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1 j range(i+1,len(l)) range i+1 i 1 len(l) len l for k in range(j+1,len(l)):
            if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1 k range(j+1,len(l)) range j+1 j 1 len(l) len l if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1 l[i] != l[j] != l[k] and l[i] < l[j] + l[k] l[i] != l[j] != l[k] l[i] != l[j] l[i] l i l[j] l j l[k] l k l[i] < l[j] + l[k] l[i] l i l[j] + l[k] l[j] l j l[k] l k ans +=1 ans 1 print(ans) print ans l = list(map(int,input().split())) list(map(int,input().split())) l n = int(input()) int(input()) n ans +=1 1 ans ans = 0 0 ans
n = int(input())
l = list(map(int,input().split()))
l.sort(reverse = True)

ans = 0

for i in range(len(l)):
    for j in range(i+1,len(l)):
        for k in range(j+1,len(l)):
            if l[i] != l[j] != l[k] and l[i] < l[j] + l[k]:
                ans +=1

print(ans)