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

const int L = 1 << 10;
int cautare_binara(int v[], int n, int nr) {
    int pas = L;
    int p = 0;

    while (pas != 0) {
        if (p + pas <= n && v[p + pas] <= nr) {
            p += pas;
        }
        pas /= 2;
    }

    return p;
}

int main()
{
    //ifstream cin("nrtri.in");
    //ofstream cout("nrtri.out");

    int v[801], n, sol = 0;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> v[i];
    }

    sort(v + 1, v + n + 1);


    for (int i = 1; i < n - 1; ++i) {
        for (int j = i + 1; j < n; ++j) {
            int sum = v[i] + v[j];
            int k = j + 1;
            while (v[k] <= sum) {
                sol++;
                k++;
            }
        }
    }

    cout << sol;


    return 0;
}