n = int(input())
l = list(map(int,input().split()))
l.sort()
ans = 0
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      a = l[i]
      b = l[j]
      c = l[k]
      if a == b or b == c or c == a:
        continue
      if l[i] + 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 for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      a = l[i]
      b = l[j]
      c = l[k]
      if a == b or b == c or c == a:
        continue
      if l[i] + 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):
      a = l[i]
      b = l[j]
      c = l[k]
      if a == b or b == c or c == a:
        continue
      if l[i] + l[j] > l[k]:
        ans += 1 j range(i+1,n) range i+1 i 1 n for k in range(j+1,n):
      a = l[i]
      b = l[j]
      c = l[k]
      if a == b or b == c or c == a:
        continue
      if l[i] + l[j] > l[k]:
        ans += 1 k range(j+1,n) range j+1 j 1 n a = l[i] a l[i] l i b = l[j] b l[j] l j c = l[k] c l[k] l k if a == b or b == c or c == a:
        continue
       a == b or b == c or c == a a == b or b == c a == b a b b == c b c c == a c a continue if l[i] + l[j] > l[k]:
        ans += 1 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 c = l[k] l[k] c a = l[i] l[i] a n = int(input()) int(input()) n b = l[j] l[j] b l = list(map(int,input().split())) list(map(int,input().split())) l ans = 0 0 ans ans += 1 1 ans
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans = 0
for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      a = l[i]
      b = l[j]
      c = l[k]
      if a == b or b == c or c == a:
        continue
      if l[i] + l[j] > l[k]:
        ans += 1
print(ans)
