#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int n,v[801];

int main()
{
    fin >> n;
    int i,j,st,dr,poz,mij,sol=0;
    for(i=1;i<=n;i++)
    {
        fin >> v[i];
    }
    sort(v+1,v+n+1);

    for(i=3;i<=n;i++) //cel mai mare element
    {
        int k = i;
        for(j=2;j<i;j++) //al doilea cel mai mare element
        {
            //cat timp putem muta k spre o pozitie buna
            while (k > 1 && v[i] <= v[j] + v[k - 1]) k--;
            if (k < j) sol = j - k;
        }
    }
    fout << sol;
    return 0;
}