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

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

count = 0
for i in range(N-2):
    for j in range(i+1, N-1):
        for k in range(j+1, N):
            x = max(L[i], L[j], L[k])
            y = L[i] + L[j] + L[k]
            if x < y - x and (L[i] != L[j] and L[i] != L[k] and L[j] != L[k]):
                count += 1

print(count)
