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

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

L.sort()
ans = 0
for i in range(N):
    for j in range(N):
        for k in range(N):
            if i < j < k and L[i] < L[j] < L[k] and L[i] + L[j] > L[k]:
                ans += 1

print(ans)
