n = int(input())
st = list(map(int,input().split()))
st.sort(reverse = True)
count = 0

for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
        
print(count) n = int(input()) n int(input()) int input() input st = list(map(int,input().split())) st list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split st.sort(reverse = True) st.sort st sort reverse = True reverse True count = 0 count 0 for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
         i range(n) range n for j in range(i+1,n):
    for k in range(j+1,n):
      if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
         j range(i+1,n) range i+1 i 1 n for k in range(j+1,n):
      if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
         k range(j+1,n) range j+1 j 1 n if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
         (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]) st[i] != st[j] != st[k] st[i] != st[j] st[i] st i st[j] st j st[k] st k st[i] < st[j] + st[k] st[i] st i st[j] + st[k] st[j] st j st[k] st k count += 1 count 1 print(count) print count count = 0 0 count count += 1 1 count st = list(map(int,input().split())) list(map(int,input().split())) st n = int(input()) int(input()) n
n = int(input())
st = list(map(int,input().split()))
st.sort(reverse = True)
count = 0

for i in range(n):
  for j in range(i+1,n):
    for k in range(j+1,n):
      if (st[i] != st[j] != st[k]) and (st[i] < st[j] + st[k]):
        count += 1
        
print(count)
