#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
const int NMAX = 800;
int v[NMAX + 1];
int N;
void input(){
fin >> N;
for (int i = 1; i <= N; i++){
fin >> v[i];
}
}
void solve2Pointers(){
int rez = 0;
for (int i = 1; i <= N - 2; i++){
int st = i + 1;
while (st < N){
int dr = st + 1;
while (dr < N && v[i] + v[st] >= v[dr + 1]){
dr++;
}
rez = (dr - st + 1);
st++;
}
}
fout << rez;
}
int main()
{
input();
sort(v + 1, v + N + 1);
solve2Pointers();
return 0;
}