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