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

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

cnt = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        if L[i] != L[j]:
            for k in range(j + 1, N):
                if L[i] != L[k] and L[j] != L[k]:
                    M = [L[i], L[j], L[k]]
                    M.sort()
                    if M[2] < M[0] + M[1]:
                        cnt += 1
print(cnt)