#include<iostream>
#include<algorithm>
#include<fstream>
#include<vector>
using namespace std;

ifstream f("nrtri.in");
ofstream g("nrtri.out");

int Cautare(int v[], int l, int r, int x)
{
    if(r >= l)
    {
        int mid = (l + r)/2;
        if(v[mid] == x)
            return mid;
        if(v[mid] > x)
            return Cautare(v,l,mid - 1,x);
        else
            return Cautare(v,mid+1,r,x);
    }
        return -1;

}


int main()
{
    int n, v[801], i, j, k, nr = 0;

    f>>n;
    for(i=0;i<n;i++)
        f>>v[i];

    sort(v,v+n);

    for(i=0;i<n;i++)
        cout<<v[i]<<" ";

    for(i=0;i<n-2;i++)
        for(j=i+1;j<n-1;j++)
            for(k=j+1;k<n;k++)
                if((v[i] + v[j]) >= v[k])
                    nr ++;

    g<<nr;












    f.close();
    g.close();
    return 0;

}