#include <fstream>
#include <stdio.h>
#include <algorithm>

using namespace std;

//return ultimul <= val
int cautbin(int v[], int st, int dr, int val) {
    printf("caut st=%d dr=%d\n", st, dr);
    int mid = (st + dr + 1) / 2;

    if (st == dr) {
        printf("gasit %d\n", st);
        return st;
    }

    if (v[mid] > val) {
        printf("mid nu e bun\n");
        return cautbin(v, st, mid - 1, val);
    } else {
        printf("mid e bun\n");
        return cautbin(v, mid, dr, val);
    }
}

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

    int N, v[800], nr = 0;

    fin >> N;

    for (int i = 0; i < N; i++) {
        fin >> v[i];
    }

    sort(v, v + N);

    for (int i = 0; i < N - 2; i++) {
        for (int j = i + 1; j < N - 1; j++) {
            printf("i=%d j=%d\n", i, j);
            int x = cautbin(v, j, N - 1, v[i] + v[j]);
            printf("ultimul pt i=%d j=%d e %d\n", i, j, x);

            nr += x - j;
        }
    }

    fout << nr;

    fin.close();
    fout.close();
    return 0;
}