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

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

ans = 0
if N > 2:
    for i in range(N - 2):
        for j in range(i + 1, N - 1):
            for k in range(j + 1, N):
                tmp = [L[i], L[j], L[k]]
                if (len(tmp) == len(set(tmp))) and (L[i] + L[j] > L[k]) and (
                        L[j] + L[k] > L[i]) and (L[k] + L[i] > L[j]):
                    ans += 1
print(ans)