N=int(input())
L=list(map(int, input().split()))
count=0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass

print(count)
 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 count=0 count 0 for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass i range(N-2) range N-2 N 2 for j in range(i+1,N-1):
        for k in range(j+1,N):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass j range(i+1,N-1) range i+1 i 1 N-1 N 1 for k in range(j+1,N):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass k range(j+1,N) range j+1 j 1 N if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i] L[i]!=L[j] and L[j]!=L[k] L[i]!=L[j] L[i] L i L[j] L j L[j]!=L[k] L[j] L j L[k] L k L[k]!=L[i] L[k] L k L[i] L i if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]) max(L[i],L[j],L[k]) max L[i] L i L[j] L j L[k] L k L[i]+L[j]+L[k]-max(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 max(L[i],L[j],L[k]) max L[i] L i L[j] L j L[k] L k count += 1 count 1 print(count) print count L=list(map(int, input().split())) list(map(int, input().split())) L count=0 0 count N=int(input()) int(input()) N count += 1 1 count
N=int(input())
L=list(map(int, input().split()))
count=0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if max(L[i],L[j],L[k])<L[i]+L[j]+L[k]-max(L[i],L[j],L[k]):
                    count += 1
                else:
                    pass

print(count)

