N = int(input())
L = list(map(int,input().split()))
if N < 3:
    print(0)
    exit()
count = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        if L[i] == L[j]:
            continue
        else:
            for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1
print(count) 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 if N < 3:
    print(0)
    exit() N < 3 N 3 print(0) print 0 exit() exit count = 0 count 0 for i in range(N-2):
    for j in range(i+1,N-1):
        if L[i] == L[j]:
            continue
        else:
            for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 i range(N-2) range N-2 N 2 for j in range(i+1,N-1):
        if L[i] == L[j]:
            continue
        else:
            for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 j range(i+1,N-1) range i+1 i 1 N-1 N 1 if L[i] == L[j]:
            continue
        else:
            for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 L[i] == L[j] L[i] L i L[j] L j continue for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 k range(j+1,N) range j+1 j 1 N if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 L[i]==L[k] or L[j]==L[k] L[i]==L[k] L[i] L i L[k] L k L[j]==L[k] L[j] L j L[k] L k continue elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1 abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k] abs(L[i]+L[j])>L[k] abs(L[i]+L[j]) abs L[i]+L[j] L[i] L i L[j] L j L[k] L k abs(L[i]-L[j])<L[k] abs(L[i]-L[j]) abs L[i]-L[j] L[i] L i L[j] L j L[k] L k count += 1 count 1 print(count) print count count = 0 0 count count += 1 1 count L = list(map(int,input().split())) list(map(int,input().split())) L N = int(input()) int(input()) N
N = int(input())
L = list(map(int,input().split()))
if N < 3:
    print(0)
    exit()
count = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        if L[i] == L[j]:
            continue
        else:
            for k in range(j+1,N):
                if L[i]==L[k] or L[j]==L[k]:
                    continue
                elif abs(L[i]+L[j])>L[k]and abs(L[i]-L[j])<L[k]:
                    count += 1
print(count)