N = int(input())
L = list(map(int,input().split()))

L = sorted(L)

ans = 0

if N < 3:
   print(ans)
   exit()

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] and 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 = sorted(L) L sorted(L) sorted L ans = 0 ans 0 if N < 3:
   print(ans)
   exit() N < 3 N 3 print(ans) print ans exit() exit 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] and 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] and 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] and 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] and L[j] != L[k]:
            ans += 1 L[i] + L[j] > L[k] and L[i] != L[j] and L[j] != L[k] L[i] + L[j] > L[k] and L[i] != L[j] L[i] + L[j] > L[k] L[i] + L[j] L[i] L i L[j] L j L[k] 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 ans += 1 ans 1 print(ans) print ans L = sorted(L) sorted(L) L ans += 1 1 ans N = int(input()) int(input()) N 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 = sorted(L)

ans = 0

if N < 3:
   print(ans)
   exit()

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] and L[j] != L[k]:
            ans += 1

print(ans)