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

ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");

const int Dim = 801;
int a[Dim];
int n;

void ReadArray();
void Rezolvare();
int BinarySearch(int l, int r, int vl, int vr);

int main()
{
    ReadArray();
    Rezolvare();
}

void ReadArray()
{
    fin >> n;
    for(int i = 1; i <= n; ++i)
        fin >> a[i];
}

void Rezolvare()
{
    sort (a + 1, a + n + 1);
    int nr = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = i + 1; j <= n; ++j)
            nr += BinarySearch(j + 1, n, a[i], a[j]);
    fout << nr;
}

int BinarySearch(int l, int r, int vl, int vr)
{
    int mid;
    int poz = 0;
    int number = l;
    int s = vl + vr;
    while (l <= r)
    {
        mid = ( l + r ) / 2;
        if (a[mid] <= s)
            poz = mid, l = mid + 1;
        if (a[mid] > s)
            r = mid - 1;
    }
    if (poz == 0)
        return 0;
    else
        return poz - number + 1;
}