#include <iostream>
#include <fstream>

using namespace std;
int n,i,j,k,nr,a[100];
bool verif(int a,int b,int c)
{
    int ok=1;
    if(a+b<c)
        ok=0;
    if(b+c<a)
        ok=0;
    if(c+a<b)
        ok=0;
    return ok;
}
void QUICKSORT(int inf, int sup) {
  int x, i, j, t;
  i = inf;
  j = sup;
  x = a[(i + j) / 2];
  do {
    while ( (i < sup) && (a[i] < x) ) i++;
    while ( (j > inf) &&(a[j] > x) ) j--;
    if ( i<= j ) {
      t = a[i];
      a[i] = a[j];
      a[j] = t;
      i++;
      j--;
    }
  } while ( i <= j );
  if ( inf < j ) QUICKSORT(inf, j);
  if ( i < sup ) QUICKSORT(i, sup);
}

int main()
{
    ifstream f("nrtri.in");
    ofstream g("nrtri.out");
    f>>n;
    for(int i=1;i<=n;i++)
        f>>a[i];
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=n;k++)
                if(verif(a[i],a[j],a[k]))
                    nr++;
    g<<nr;
    cout << "Hello world!" << endl;
    return 0;
}