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