n = int(input())
l = sorted(map(int, input().split()))
c = 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] != l[k] and l[i] + l[j] > l[k]:
                c += 1
print(c) n = int(input()) n int(input()) int input() input l = sorted(map(int, input().split())) l sorted(map(int, input().split())) sorted map(int, input().split()) map int input().split() ().split () input split c = 0 c 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] != l[k] and l[i] + l[j] > l[k]:
                c += 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] != l[k] and l[i] + l[j] > l[k]:
                c += 1 j range(i + 1, n) range i + 1 i 1 n for k in range(j + 1, n):
            if l[i] != l[j] != l[k] and l[i] + l[j] > l[k]:
                c += 1 k range(j + 1, n) range j + 1 j 1 n if l[i] != l[j] != l[k] and l[i] + l[j] > l[k]:
                c += 1 l[i] != l[j] != l[k] and l[i] + l[j] > l[k] l[i] != l[j] != l[k] l[i] != l[j] l[i] l i l[j] l j l[k] l k l[i] + l[j] > l[k] l[i] + l[j] l[i] l i l[j] l j l[k] l k c += 1 c 1 print(c) print c c = 0 0 c c += 1 1 c l = sorted(map(int, input().split())) sorted(map(int, input().split())) l n = int(input()) int(input()) n
n = int(input())
l = sorted(map(int, input().split()))
c = 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] != l[k] and l[i] + l[j] > l[k]:
                c += 1
print(c)
