N = int(input())
L = sorted([int(i) for i in input().split()], reverse=True)
# print(L)
ans = 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]+L[k] and L[i] != L[j] != L[k]:
                ans += 1
print(ans) 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 = sorted([int(i) for i in input().split()], reverse=True) L sorted([int(i) for i in input().split()], reverse=True) sorted [int(i) for i in input().split()] reverse=True reverse True ans = 0 ans 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]+L[k] and L[i] != L[j] != L[k]:
                ans += 1 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]+L[k] and L[i] != L[j] != L[k]:
                ans += 1 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]+L[k] and 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] and L[i] != L[j] != L[k]:
                ans += 1 L[i] < L[j]+L[k] and L[i] != L[j] != L[k] L[i] < L[j]+L[k] L[i] L i L[j]+L[k] L[j] L j L[k] L k 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 L = sorted([int(i) for i in input().split()], reverse=True) sorted([int(i) for i in input().split()], reverse=True) L ans = 0 0 ans N = int(input()) int(input()) N ans += 1 1 ans
N = int(input())
L = sorted([int(i) for i in input().split()], reverse=True)
# print(L)
ans = 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]+L[k] and L[i] != L[j] != L[k]:
                ans += 1
print(ans)
