N = int(input())
L = list(map(int, input().split()))
c = 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[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=1
 
print(c) 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 c = 0 c 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[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=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[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=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[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=1
  k range(j+1,N) range j+1 j 1 N if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=1
  L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i] 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[k]!=L[i] L[k] L k L[i] L i if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=1
  L[i] + L[j] + L[k] > 2 * max(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 2 * max(L[i],L[j],L[k]) 2 max(L[i],L[j],L[k]) max L[i] L i L[j] L j L[k] L k c +=1 c 1 print(c) print c L = list(map(int, input().split())) list(map(int, input().split())) L c = 0 0 c N = int(input()) int(input()) N c +=1 1 c
N = int(input())
L = list(map(int, input().split()))
c = 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[k]!=L[i]:
        if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
          c +=1
 
print(c)