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