N = int(input())
L = list(map(int,input().split()))
L = sorted(L)

cnt = 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] or L[j] == L[k]:
                continue
            if L[i] + L[j] > L[k]:
                cnt += 1

print(cnt) 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 L = sorted(L) L sorted(L) sorted L cnt = 0 cnt 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] or L[j] == L[k]:
                continue
            if L[i] + L[j] > L[k]:
                cnt += 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] or L[j] == L[k]:
                continue
            if L[i] + L[j] > L[k]:
                cnt += 1 j range(i+1,N) range i+1 i 1 N for k in range(j+1,N):
            if L[i] == L[j] or L[j] == L[k]:
                continue
            if L[i] + L[j] > L[k]:
                cnt += 1 k range(j+1,N) range j+1 j 1 N if L[i] == L[j] or L[j] == L[k]:
                continue
             L[i] == L[j] or L[j] == L[k] L[i] == L[j] L[i] L i L[j] L j L[j] == L[k] L[j] L j L[k] L k continue if L[i] + L[j] > L[k]:
                cnt += 1 L[i] + L[j] > L[k] L[i] + L[j] L[i] L i L[j] L j L[k] L k cnt += 1 cnt 1 print(cnt) print cnt N = int(input()) int(input()) N L = list(map(int,input().split())) list(map(int,input().split())) L L = sorted(L) sorted(L) L cnt = 0 0 cnt cnt += 1 1 cnt
N = int(input())
L = list(map(int,input().split()))
L = sorted(L)

cnt = 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] or L[j] == L[k]:
                continue
            if L[i] + L[j] > L[k]:
                cnt += 1

print(cnt)
