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

using namespace std;

ifstream f("devt.in");
ofstream g("devt.out");

int v[801], n, i, j, cnt, suma, k;

void read()
{
    f >> n;
    for (int i=1; i<=n; i++)
         f >> v[i];
}

int main()
{
    read();
   sort(v+1, v+n+1);
     for (i=1; i<=n-2; i++)
         for (j=i+1; j<=n-1; j++)
            for (k=j+1; k<=n; k++)
           {
                 suma = v[i] + v[j];
                  if(suma >= v[k])
                     cnt ++;
           }
    g << cnt;
    return 0;
}