n = int(input())
l = list(map(int, input().split()))
l.sort()
count = 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] and l[j] != l[k] and l[j] + l[i] > l[k]:
         count += 1
print(count) 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 count = 0 count 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] and l[j] != l[k] and l[j] + l[i] > l[k]:
         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] and l[j] != l[k] and l[j] + l[i] > l[k]:
         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] and l[j] != l[k] and l[j] + l[i] > l[k]:
         count += 1 k range(j + 1, n) range j + 1 j 1 n if l[i] != l[j] and l[j] != l[k] and l[j] + l[i] > l[k]:
         count += 1 l[i] != l[j] and l[j] != l[k] and l[j] + l[i] > l[k] 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[j] + l[i] > l[k] l[j] + l[i] l[j] l j l[i] l i l[k] l k count += 1 count 1 print(count) print count count += 1 1 count l = list(map(int, input().split())) list(map(int, input().split())) l n = int(input()) int(input()) n count = 0 0 count
n = int(input())
l = list(map(int, input().split()))
l.sort()
count = 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] and l[j] != l[k] and l[j] + l[i] > l[k]:
         count += 1
print(count)