x = input()
N = int(x)
L = list(map(int,input().split()))
count = 0


for i in range(N-2):
    for j in range(i+1,N-1):
        if L[i] != L[j]:
            for k in range(j+1,N):
                if (L[i] != L[k]) and (L[j] != L[k]) and (L[i] + L[j] > L[k]) and (L[j] + L[k] > L[i]) and (L[k] + L[i] > L[j]):
                    count = count + 1

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


for i in range(N-2):
    for j in range(i+1,N-1):
        if L[i] != L[j]:
            for k in range(j+1,N):
                if (L[i] != L[k]) and (L[j] != L[k]) and (L[i] + L[j] > L[k]) and (L[j] + L[k] > L[i]) and (L[k] + L[i] > L[j]):
                    count = count + 1

print(count)