n = int(input())
L = sorted(list(map(int,input().split())))
cnt = 0
for i in range(n):
  for j in range(i):
    for k in range(j):
      if L[i] == L[j]: continue
      if L[j] == L[k]: continue
      if L[k] == L[i]: continue
      if L[k] + L[j] > L[i]:
        cnt += 1
print(cnt) n = int(input()) n int(input()) int input() input L = sorted(list(map(int,input().split()))) L sorted(list(map(int,input().split()))) sorted 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):
    for k in range(j):
      if L[i] == L[j]: continue
      if L[j] == L[k]: continue
      if L[k] == L[i]: continue
      if L[k] + L[j] > L[i]:
        cnt += 1 i range(n) range n for j in range(i):
    for k in range(j):
      if L[i] == L[j]: continue
      if L[j] == L[k]: continue
      if L[k] == L[i]: continue
      if L[k] + L[j] > L[i]:
        cnt += 1 j range(i) range i for k in range(j):
      if L[i] == L[j]: continue
      if L[j] == L[k]: continue
      if L[k] == L[i]: continue
      if L[k] + L[j] > L[i]:
        cnt += 1 k range(j) range j if L[i] == L[j]: continue
       L[i] == L[j] L[i] L i L[j] L j if L[j] == L[k]: continue
       L[j] == L[k] L[j] L j L[k] L k if L[k] == L[i]: continue
       L[k] == L[i] L[k] L k L[i] L i if L[k] + L[j] > L[i]:
        cnt += 1 L[k] + L[j] > L[i] L[k] + L[j] L[k] L k L[j] L j L[i] L i cnt += 1 cnt 1 print(cnt) print cnt cnt += 1 1 cnt L = sorted(list(map(int,input().split()))) sorted(list(map(int,input().split()))) L cnt = 0 0 cnt n = int(input()) int(input()) n
n = int(input())
L = sorted(list(map(int,input().split())))
cnt = 0
for i in range(n):
  for j in range(i):
    for k in range(j):
      if L[i] == L[j]: continue
      if L[j] == L[k]: continue
      if L[k] == L[i]: continue
      if L[k] + L[j] > L[i]:
        cnt += 1
print(cnt)