#include <iostream>
#include <stdio.h>
using namespace std;
int a[810], n,nrtri,s,j;
void qsort(int a[810], int left, int right)
{
    int m=(left+right)/2, i=left, j=right,aux;
    int pivot=a[m];
    while(i<=j)
    {
        while(a[i]<pivot) i++;
        while(a[j]>pivot) j--;
        if(i<=j)
        {
            aux=a[i]; a[i]=a[j]; a[j]=aux;
            i++; j--;
        }
    }
    if(left<j) qsort(a, left, j);
    if(i<right) qsort(a,i,right);
}

int main()
{
    freopen("nrtri.in","r",stdin);
    freopen("nrtri.out","w",stdout);
    scanf("%d", &n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    qsort(a,1,n);
    for(int i=1;i<n-1;i++)
    {
        s=a[i]+a[i+1];
        j=i+2;
        while(a[j]<=s and j<=n){ nrtri++; j++; }
    }
    cout<<nrtri;
    return 0;
}