#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

int n, i, j, v[800], st, dr, mid, k;
long nrt;

int main () {
    
    ifstream fin("nrtri.in");
    ofstream fout("nrtri.out");
    
    fin >> n;
    for (i = 1; i <= n; i++)    fin >> v[i];
    sort (v+1 , v+n+1);
    
    /*for (i = 1; i <= n-2; i++)
        for (j = i+2; j <= n; j++)
        {
            st = i;     dr = j;
            while (st <= dr-2)
            {
                mid = st + (dr-st)/2;
                if (v[mid]+v[i]>=v[j] && v[i]+v[j]>=v[mid] && v[mid]+v[j]>=v[i])    nrt++;
                st++;
            }
        }
    */
    
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
        {
            for (k = i+1; k < j; k++)
                if (v[k]+v[i]>=v[j] && v[i]+v[j]>=v[k] && v[k]+v[j]>=v[i])    nrt++;
        }
    
    fout << nrt;
}