按照两数之和的思想解
n = int(input())
l = [int(val) for val in input().split(' ')]
l = sorted(l)
nums = 0
for i in range(n-2):
for j in range(i+1,n-1):
pre_sum = l[i] + l [j]
for k in range(j+1,n):
if pre_sum > l[k]:
nums += 1
else:
break
print(nums)