N = int(input())
L = list(map(int, input().split()))

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

count = 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[i] != L[k] and max(L[i],L[j],L[k]) < sum([L[i],L[j],L[k]])/2:
                count+=1
print(count)