n = int(input())
l = list(map(int, input().split()))

ans = 0
for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            _lst = [l[i], l[j], l[k]]

            if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    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(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            _lst = [l[i], l[j], l[k]]

            if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    ans += 1 i range(n) range n for j in range(i+1, n):
        for k in range(j+1, n):
            _lst = [l[i], l[j], l[k]]

            if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    ans += 1 j range(i+1, n) range i+1 i 1 n for k in range(j+1, n):
            _lst = [l[i], l[j], l[k]]

            if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    ans += 1 k range(j+1, n) range j+1 j 1 n _lst = [l[i], l[j], l[k]] _lst [l[i], l[j], l[k]] l[i] l i l[j] l j l[k] l k if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    ans += 1 len(set(_lst)) == 3 len(set(_lst)) len set(_lst) set _lst 3 _max = max(_lst) _max max(_lst) max _lst _lst.remove(_max) _lst.remove _lst remove _max if _max < sum(_lst):
                    ans += 1 _max < sum(_lst) _max sum(_lst) sum _lst ans += 1 ans 1 print(ans) print ans _max = max(_lst) max(_lst) _max l = list(map(int, input().split())) list(map(int, input().split())) l n = int(input()) int(input()) n _lst = [l[i], l[j], l[k]] [l[i], l[j], l[k]] _lst ans += 1 1 ans ans = 0 0 ans
n = int(input())
l = list(map(int, input().split()))

ans = 0
for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            _lst = [l[i], l[j], l[k]]

            if len(set(_lst)) == 3:
                _max = max(_lst)
                _lst.remove(_max)
                if _max < sum(_lst):
                    ans += 1

print(ans)
