#include <cstdio>
#include <algorithm>
using namespace std;

int j,S,k,sol,n,i,a[1001];

int main()
{
    freopen("nrtri.in", "r", stdin);
    freopen("nrtri.out", "w", stdout);
    scanf("%d", &n);
    for(i=0; i<n; ++i)
        scanf("%d", &a[i]);
    sort(a, a+n);
    for(i=1; i<n-1; i++)
        for(j=i+1; j<n; j++)
            {
                S = a[i] + a[j];
                k = upper_bound(a, a+n, S) - a;
                sol += (k-j-1);
            }
    printf("%d", sol);
    return 0;
}