N = int(input())
L = [int(i) for i in input().split()]

count = 0
L.sort()
for i in range(N) :
    for j in range(i+1,N) :
        for k in range(j+1,N) :
            if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                
print(count) N = int(input()) N int(input()) int input() input int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i L = [int(i) for i in input().split()] L [int(i) for i in input().split()] count = 0 count 0 L.sort() L.sort L sort for i in range(N) :
    for j in range(i+1,N) :
        for k in range(j+1,N) :
            if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                 i range(N) range N for j in range(i+1,N) :
        for k in range(j+1,N) :
            if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                 j range(i+1,N) range i+1 i 1 N for k in range(j+1,N) :
            if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                 k range(j+1,N) range j+1 j 1 N if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                 L[i]!=L[j]!=L[k] L[i]!=L[j] L[i] L i L[j] L j L[k] L k if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                 (L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j]) (L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) L[i]+L[j]>L[k] L[i]+L[j] L[i] L i L[j] L j L[k] L k L[j]+L[k]>L[i] L[j]+L[k] L[j] L j L[k] L k L[i] L i L[i]+L[k]>L[j] L[i]+L[k] L[i] L i L[k] L k L[j] L j count += 1 count 1 print(count) print count L = [int(i) for i in input().split()] [int(i) for i in input().split()] L count += 1 1 count count = 0 0 count N = int(input()) int(input()) N
N = int(input())
L = [int(i) for i in input().split()]

count = 0
L.sort()
for i in range(N) :
    for j in range(i+1,N) :
        for k in range(j+1,N) :
            if L[i]!=L[j]!=L[k]:
                if ((L[i]+L[j]>L[k]) and (L[j]+L[k]>L[i]) and (L[i]+L[k]>L[j])) :
                    count += 1
                
print(count)