#include<bits/stdc++.h>
using namespace std;

const int NMAX = 8e2+1;
int N, vec[NMAX], nr;

void citire()
{
    freopen("nrtri.in", "r", stdin);
    freopen("nrtri.out", "w", stdout);

    scanf("%d", &N);
    for(int i = 1; i <= N; i++) scanf("%d", &vec[i]);
}
/*
void cautare(int i, j)
{
    int left = j, right = N;
    while(left < )
}
*/
int main()
{
    citire();
    sort(vec, vec+N);
    for(int i = 1; i <= N; i++){
        bool exista = false;
        for(int j = i+1; j <= N; j++)
        {
            for(int t = j; t <= N; t++)
                if((vec[i] + vec[j] >= vec[t] && vec[i] + vec[j]) < vec[t+1] || (vec[t]<=vec[i]+vec[j] && t==N-1))
                    exista = true;
        }
        if(exista == true) nr ++;
    }
    printf("%d", nr);
    return 0;
}