n=int(input())
l=sorted([int(x) for x in input().split()])
a=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]:
        a+=1
print(a)         n=int(input()) n int(input()) int input() input int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x l=sorted([int(x) for x in input().split()]) l sorted([int(x) for x in input().split()]) sorted [int(x) for x in input().split()] a=0 a 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]:
        a+=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]:
        a+=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]:
        a+=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]:
        a+=1 l[i]<l[j]<l[k] and 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 l[i]+l[j]>l[k] l[i]+l[j] l[i] l i l[j] l j l[k] l k a+=1 a 1 print(a) print a a=0 0 a a+=1 1 a l=sorted([int(x) for x in input().split()]) sorted([int(x) for x in input().split()]) l n=int(input()) int(input()) n
n=int(input())
l=sorted([int(x) for x in input().split()])
a=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]:
        a+=1
print(a)        