N = int(input())
A = sorted(map(int, input().split())) 

X = 0
Y = 0

B = []

for i in range(N-2):
    X = i + 1
    for j in range(X,N-1):
        Y = j + 1
        for k in range(Y, N):
            if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k]))

print(len(B)) N = int(input()) N int(input()) int input() input A = sorted(map(int, input().split())) A sorted(map(int, input().split())) sorted map(int, input().split()) map int input().split() ().split () input split X = 0 X 0 Y = 0 Y 0 B = [] B [] for i in range(N-2):
    X = i + 1
    for j in range(X,N-1):
        Y = j + 1
        for k in range(Y, N):
            if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k])) i range(N-2) range N-2 N 2 X = i + 1 X i + 1 i 1 for j in range(X,N-1):
        Y = j + 1
        for k in range(Y, N):
            if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k])) j range(X,N-1) range X N-1 N 1 Y = j + 1 Y j + 1 j 1 for k in range(Y, N):
            if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k])) k range(Y, N) range Y N if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k])) A[k] < A[i] + A[j] A[k] A k A[i] + A[j] A[i] A i A[j] A j if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k])) A[k] != A[i] and A[i] != A[j] and A[k] != A[j] A[k] != A[i] and A[i] != A[j] A[k] != A[i] A[k] A k A[i] A i A[i] != A[j] A[i] A i A[j] A j A[k] != A[j] A[k] A k A[j] A j B.append((A[i],A[j],A[k])) B.append B append (A[i],A[j],A[k]) A[i] A i A[j] A j A[k] A k print(len(B)) print len(B) len B Y = 0 0 Y Y = j + 1 j + 1 Y N = int(input()) int(input()) N X = i + 1 i + 1 X B = [] [] B A = sorted(map(int, input().split())) sorted(map(int, input().split())) A X = 0 0 X
N = int(input())
A = sorted(map(int, input().split())) 

X = 0
Y = 0

B = []

for i in range(N-2):
    X = i + 1
    for j in range(X,N-1):
        Y = j + 1
        for k in range(Y, N):
            if A[k] < A[i] + A[j]:
                if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
                    B.append((A[i],A[j],A[k]))

print(len(B))