n=int(input())
l=sorted(list(map(int,input().split())),reverse=True)
count=0
for i in range(n-2):
  for j in range(i+1,n-1):
    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=sorted(list(map(int,input().split())),reverse=True) l sorted(list(map(int,input().split())),reverse=True) sorted list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split reverse=True reverse True count=0 count 0 for i in range(n-2):
  for j in range(i+1,n-1):
    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-2) range n-2 n 2 for j in range(i+1,n-1):
    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-1) range i+1 i 1 n-1 n 1 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 i l[j]+l[k] 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=sorted(list(map(int,input().split())),reverse=True) sorted(list(map(int,input().split())),reverse=True) l n=int(input()) int(input()) n count=0 0 count count+=1 1 count
n=int(input())
l=sorted(list(map(int,input().split())),reverse=True)
count=0
for i in range(n-2):
  for j in range(i+1,n-1):
    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)