# 175 B
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0

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

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