# ABC172 Making Triangle
N = int(input())
L = list(map(int,input().split()))
d = {i:L.count(i) for i in L}

L = sorted(L)
ans = 0
cnt = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            cnt += 1
            if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and 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 i:L.count(i) for i in L for i in L i L for i in L i L.count(i) L.count L count i d = {i:L.count(i) for i in L} d {i:L.count(i) for i in L} L = sorted(L) L sorted(L) sorted L ans = 0 ans 0 cnt = 0 cnt 0 for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            cnt += 1
            if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and 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):
            cnt += 1
            if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and 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):
            cnt += 1
            if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and L[j] != L[k]:
                ans += 1 k range(j+1,N) range j+1 j 1 N cnt += 1 cnt 1 if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and L[j] != L[k]:
                ans += 1 L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and L[j] != L[k] L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] L[k] < L[i] + L[j] and L[k] != L[i] L[k] < L[i] + L[j] L[k] L k L[i] + L[j] L[i] L i L[j] L j L[k] != L[i] L[k] L k L[i] L i L[i] != L[j] L[i] L i L[j] L j L[j] != L[k] L[j] L j L[k] L k ans += 1 ans 1 print(ans) print ans N = int(input()) int(input()) N ans = 0 0 ans L = list(map(int,input().split())) list(map(int,input().split())) L d = {i:L.count(i) for i in L} {i:L.count(i) for i in L} d ans += 1 1 ans cnt += 1 1 cnt cnt = 0 0 cnt L = sorted(L) sorted(L) L
# ABC172 Making Triangle
N = int(input())
L = list(map(int,input().split()))
d = {i:L.count(i) for i in L}

L = sorted(L)
ans = 0
cnt = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            cnt += 1
            if L[k] < L[i] + L[j] and L[k] != L[i] and L[i] != L[j] and L[j] != L[k]:
                ans += 1
print(ans)