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

ans = 0

for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i] == l[j]:
                continue
            if l[j] == l[k]:
                continue
            if l[i] == l[k]:
                continue
            if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 1

print(ans) 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 ans = 0 ans 0 for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i] == l[j]:
                continue
            if l[j] == l[k]:
                continue
            if l[i] == l[k]:
                continue
            if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 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):
            if l[i] == l[j]:
                continue
            if l[j] == l[k]:
                continue
            if l[i] == l[k]:
                continue
            if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 1 j range(i+1,n-1) range i+1 i 1 n-1 n 1 for k in range(j+1,n):
            if l[i] == l[j]:
                continue
            if l[j] == l[k]:
                continue
            if l[i] == l[k]:
                continue
            if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 1 k range(j+1,n) range j+1 j 1 n if l[i] == l[j]:
                continue
             l[i] == l[j] l[i] l i l[j] l j continue if l[j] == l[k]:
                continue
             l[j] == l[k] l[j] l j l[k] l k continue if l[i] == l[k]:
                continue
             l[i] == l[k] l[i] l i l[k] l k continue if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 1 max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k] max(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 2 l[i] + l[j] + l[k] l[i] + l[j] l[i] l i l[j] l j l[k] l k ans += 1 ans 1 print(ans) print ans l = list(map(int, input().split())) list(map(int, input().split())) l n = int(input()) int(input()) n ans = 0 0 ans ans += 1 1 ans
n = int(input())
l = list(map(int, input().split()))

ans = 0

for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i] == l[j]:
                continue
            if l[j] == l[k]:
                continue
            if l[i] == l[k]:
                continue
            if max(l[i], l[j], l[k]) * 2 < l[i] + l[j] + l[k]:
                ans += 1

print(ans)