N=int(input())
L=list(map(int,input().split()))
L.sort()
ans=0
for i in range(N):
    for j in range(i+1,N):
        if L[i]==L[j]:
            continue
        for k in range(j+1,N):
            if L[j]==L[k]:
                continue
            if 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() L.sort L sort ans=0 ans 0 for i in range(N):
    for j in range(i+1,N):
        if L[i]==L[j]:
            continue
        for k in range(j+1,N):
            if L[j]==L[k]:
                continue
            if L[i]+L[j]>L[k]:
                ans+=1 i range(N) range N for j in range(i+1,N):
        if L[i]==L[j]:
            continue
        for k in range(j+1,N):
            if L[j]==L[k]:
                continue
            if L[i]+L[j]>L[k]:
                ans+=1 j range(i+1,N) range i+1 i 1 N if L[i]==L[j]:
            continue
         L[i]==L[j] L[i] L i L[j] L j continue for k in range(j+1,N):
            if L[j]==L[k]:
                continue
            if L[i]+L[j]>L[k]:
                ans+=1 k range(j+1,N) range j+1 j 1 N if L[j]==L[k]:
                continue
             L[j]==L[k] L[j] L j L[k] L k continue if L[i]+L[j]>L[k]:
                ans+=1 L[i]+L[j]>L[k] L[i]+L[j] L[i] L i L[j] L j L[k] L k ans+=1 ans 1 print(ans) print ans N=int(input()) int(input()) N ans+=1 1 ans ans=0 0 ans L=list(map(int,input().split())) list(map(int,input().split())) L
N=int(input())
L=list(map(int,input().split()))
L.sort()
ans=0
for i in range(N):
    for j in range(i+1,N):
        if L[i]==L[j]:
            continue
        for k in range(j+1,N):
            if L[j]==L[k]:
                continue
            if L[i]+L[j]>L[k]:
                ans+=1
print(ans)
