n = int(input())
L = sorted(map(int,input().split()))
ans = 0

if n < 3:
    print(ans)
    exit()

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] != L[k]:
                if L[i] + L[j] > L[k]:
                    ans += 1
                    
print(ans) 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 ans = 0 ans 0 if n < 3:
    print(ans)
    exit() n < 3 n 3 print(ans) print ans exit() exit 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] != L[k]:
                if 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] != L[k]:
                if 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] != L[k]:
                if L[i] + L[j] > L[k]:
                    ans += 1
                     k range(j+1,n) range j+1 j 1 n if L[i] != L[j] != L[k]:
                if L[i] + L[j] > L[k]:
                    ans += 1
                     L[i] != L[j] != L[k] L[i] != L[j] L[i] L i L[j] L j L[k] L k if L[i] + L[j] > L[k]:
                    ans += 1
                     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 = sorted(map(int,input().split())) sorted(map(int,input().split())) L ans = 0 0 ans n = int(input()) int(input()) n ans += 1 1 ans
n = int(input())
L = sorted(map(int,input().split()))
ans = 0

if n < 3:
    print(ans)
    exit()

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] != L[k]:
                if L[i] + L[j] > L[k]:
                    ans += 1
                    
print(ans)