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