N = int(input())
Ls = list(map(int,input().split()))
ans = 0

for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            m = max(Ls[i],Ls[j],Ls[k])
            if Ls[i] + Ls[j] + Ls[k] - 2*m > 0 and Ls[i] != Ls[j] and Ls[i] != Ls[k] and Ls[j] != Ls[k]:
                ans += 1

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

for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            m = max(Ls[i],Ls[j],Ls[k])
            if Ls[i] + Ls[j] + Ls[k] - 2*m > 0 and Ls[i] != Ls[j] and Ls[i] != Ls[k] and Ls[j] != Ls[k]:
                ans += 1

print(ans)
