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

a = 0
        
for i in range(n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            if l[k] < l[i] + l[j] and l[i] < l[j] and l[j] < l[k]:
                a += 1

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

a = 0
        
for i in range(n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            if l[k] < l[i] + l[j] and l[i] < l[j] and l[j] < l[k]:
                a += 1

print(a)
