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