# B - Making Triangle

n = int(input())
l = list(map(int, input().split()))
assert n == len(l)

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] or l[j] == l[k] or l[k] == l[i]:
                continue
            a, b, c = sorted((l[i], l[j], l[k]))
            if a + b > c:
                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 assert n == len(l) n == len(l) n len(l) len l 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] or l[j] == l[k] or l[k] == l[i]:
                continue
            a, b, c = sorted((l[i], l[j], l[k]))
            if a + b > c:
                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] or l[j] == l[k] or l[k] == l[i]:
                continue
            a, b, c = sorted((l[i], l[j], l[k]))
            if a + b > c:
                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] or l[j] == l[k] or l[k] == l[i]:
                continue
            a, b, c = sorted((l[i], l[j], l[k]))
            if a + b > c:
                count += 1 k range(j + 1, n) range j + 1 j 1 n if l[i] == l[j] or l[j] == l[k] or l[k] == l[i]:
                continue
             l[i] == l[j] or l[j] == l[k] or l[k] == l[i] l[i] == l[j] or 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[k] == l[i] l[k] l k l[i] l i continue a, b, c = sorted((l[i], l[j], l[k])) a sorted((l[i], l[j], l[k])) sorted (l[i], l[j], l[k]) l[i] l i l[j] l j l[k] l k b c if a + b > c:
                count += 1 a + b > c a + b a b c count += 1 count 1 print(count) print count a, b, c = sorted((l[i], l[j], l[k])) sorted((l[i], l[j], l[k])) a count = 0 0 count c = sorted((l[i], l[j], l[k])) sorted((l[i], l[j], l[k])) c n = int(input()) int(input()) n b, c = sorted((l[i], l[j], l[k])) sorted((l[i], l[j], l[k])) b l = list(map(int, input().split())) list(map(int, input().split())) l count += 1 1 count
# B - Making Triangle

n = int(input())
l = list(map(int, input().split()))
assert n == len(l)

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] or l[j] == l[k] or l[k] == l[i]:
                continue
            a, b, c = sorted((l[i], l[j], l[k]))
            if a + b > c:
                count += 1
print(count)
