n = int(input())
L = [int(x) for x in input().split()]
L.sort()
ans = 0

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]:
                    ans += 1

print(ans) n = int(input()) n int(input()) int input() input int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x L = [int(x) for x in input().split()] L [int(x) for x in input().split()] L.sort() L.sort L sort ans = 0 ans 0 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]:
                    ans += 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]:
                    ans += 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]:
                    ans += 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]:
                    ans += 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]:
                    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 L = [int(x) for x in input().split()] [int(x) for x in input().split()] L ans = 0 0 ans
n = int(input())
L = [int(x) for x in input().split()]
L.sort()
ans = 0

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]:
                    ans += 1

print(ans)
