N = int(input())
bar = list(map(int, input().split()))
triangles = []
for i in range(N-2):
    for j in range(i + 1, N - 1):
        if bar[i] == bar[j]:
            continue
        for k in range(j + 1, N):
            if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
            if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]])
print(len(triangles)) N = int(input()) N int(input()) int input() input bar = list(map(int, input().split())) bar list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split triangles = [] triangles [] for i in range(N-2):
    for j in range(i + 1, N - 1):
        if bar[i] == bar[j]:
            continue
        for k in range(j + 1, N):
            if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
            if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]]) i range(N-2) range N-2 N 2 for j in range(i + 1, N - 1):
        if bar[i] == bar[j]:
            continue
        for k in range(j + 1, N):
            if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
            if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]]) j range(i + 1, N - 1) range i + 1 i 1 N - 1 N 1 if bar[i] == bar[j]:
            continue
         bar[i] == bar[j] bar[i] bar i bar[j] bar j continue for k in range(j + 1, N):
            if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
            if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]]) k range(j + 1, N) range j + 1 j 1 N if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
             bar[j] == bar[k] or bar[i] == bar[k] bar[j] == bar[k] bar[j] bar j bar[k] bar k bar[i] == bar[k] bar[i] bar i bar[k] bar k continue if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]]) (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]) (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) bar[i] + bar[j] > bar[k] bar[i] + bar[j] bar[i] bar i bar[j] bar j bar[k] bar k bar[j] + bar[k] > bar[i] bar[j] + bar[k] bar[j] bar j bar[k] bar k bar[i] bar i bar[i] + bar[k] > bar[j] bar[i] + bar[k] bar[i] bar i bar[k] bar k bar[j] bar j triangles.append([bar[i], bar[j], bar[k]]) triangles.append triangles append [bar[i], bar[j], bar[k]] bar[i] bar i bar[j] bar j bar[k] bar k print(len(triangles)) print len(triangles) len triangles N = int(input()) int(input()) N triangles = [] [] triangles bar = list(map(int, input().split())) list(map(int, input().split())) bar
N = int(input())
bar = list(map(int, input().split()))
triangles = []
for i in range(N-2):
    for j in range(i + 1, N - 1):
        if bar[i] == bar[j]:
            continue
        for k in range(j + 1, N):
            if bar[j] == bar[k] or bar[i] == bar[k]:
                continue
            if (bar[i] + bar[j] > bar[k]) and (bar[j] + bar[k] > bar[i]) and (bar[i] + bar[k] > bar[j]):# and (len(set([bar[i], bar[j], bar[k]])) == 3):
                triangles.append([bar[i], bar[j], bar[k]])
print(len(triangles))
