n = int(input())
l = list(map(int, input().split()))
cnt = 0
for i in range(n):
  for j in range(i + 1, n):
    for k in range(j + 1, n):
      sum_ = sum([l[i], l[j], l[k]])
      max_ = max([l[i], l[j], l[k]])
      if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1
print(cnt) 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 cnt = 0 cnt 0 for i in range(n):
  for j in range(i + 1, n):
    for k in range(j + 1, n):
      sum_ = sum([l[i], l[j], l[k]])
      max_ = max([l[i], l[j], l[k]])
      if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1 i range(n) range n for j in range(i + 1, n):
    for k in range(j + 1, n):
      sum_ = sum([l[i], l[j], l[k]])
      max_ = max([l[i], l[j], l[k]])
      if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1 j range(i + 1, n) range i + 1 i 1 n for k in range(j + 1, n):
      sum_ = sum([l[i], l[j], l[k]])
      max_ = max([l[i], l[j], l[k]])
      if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1 k range(j + 1, n) range j + 1 j 1 n sum_ = sum([l[i], l[j], l[k]]) sum_ sum([l[i], l[j], l[k]]) sum [l[i], l[j], l[k]] l[i] l i l[j] l j l[k] l k max_ = max([l[i], l[j], l[k]]) max_ max([l[i], l[j], l[k]]) max [l[i], l[j], l[k]] l[i] l i l[j] l j l[k] l k if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1 l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_ l[i] != l[j] and l[i] != l[k] and l[j] != l[k] l[i] != l[j] and l[i] != l[k] l[i] != l[j] l[i] l i l[j] l j l[i] != l[k] l[i] l i l[k] l k l[j] != l[k] l[j] l j l[k] l k (sum_ - max_) > max_ sum_ - max_ sum_ max_ max_ cnt += 1 cnt 1 print(cnt) print cnt max_ = max([l[i], l[j], l[k]]) max([l[i], l[j], l[k]]) max_ sum_ = sum([l[i], l[j], l[k]]) sum([l[i], l[j], l[k]]) sum_ n = int(input()) int(input()) n cnt = 0 0 cnt l = list(map(int, input().split())) list(map(int, input().split())) l cnt += 1 1 cnt
n = int(input())
l = list(map(int, input().split()))
cnt = 0
for i in range(n):
  for j in range(i + 1, n):
    for k in range(j + 1, n):
      sum_ = sum([l[i], l[j], l[k]])
      max_ = max([l[i], l[j], l[k]])
      if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and (sum_ - max_) > max_:
        cnt += 1
print(cnt)