n = int(input())
total = 0

A = list(map(int, input().split()))

for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            B = [A[i], A[j], A[k]]
            if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1

print(total) n = int(input()) n int(input()) int input() input total = 0 total 0 A = list(map(int, input().split())) A list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            B = [A[i], A[j], A[k]]
            if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1 i range(n) range n for j in range(i+1, n):
        for k in range(j+1, n):
            B = [A[i], A[j], A[k]]
            if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1 j range(i+1, n) range i+1 i 1 n for k in range(j+1, n):
            B = [A[i], A[j], A[k]]
            if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1 k range(j+1, n) range j+1 j 1 n B = [A[i], A[j], A[k]] B [A[i], A[j], A[k]] A[i] A i A[j] A j A[k] A k if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1 len(set(B)) == 3 and (max(B) < sum(B) - max(B)) len(set(B)) == 3 len(set(B)) len set(B) set B 3 max(B) < sum(B) - max(B) max(B) max B sum(B) - max(B) sum(B) sum B max(B) max B total += 1 total 1 print(total) print total total = 0 0 total A = list(map(int, input().split())) list(map(int, input().split())) A B = [A[i], A[j], A[k]] [A[i], A[j], A[k]] B total += 1 1 total n = int(input()) int(input()) n
n = int(input())
total = 0

A = list(map(int, input().split()))

for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            B = [A[i], A[j], A[k]]
            if len(set(B)) == 3 and (max(B) < sum(B) - max(B)):
                total += 1

print(total)