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

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

ans = 0
for i in range(len(L)):
    for j in range(len(L)):
        for k in range(len(L)):
            if i < j < k:
                if L[i] == L[j] or L[j] == L[k] or L[k] == L[i]:
                    continue
                if L[i] + L[j] + L[k] <= max(L[i], L[j], L[k]) * 2:
                    continue
                ans += 1

print(ans)