#include<stdio.h>
#include <algorithm>


using namespace std;

int n,a[1000],nr;

void citire()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
      scanf("%d",&a[i]);
    sort(a+1,a+n+1);
}

void solve()
{
    for(int i=1;i<=n-2;i++)
       {
        int v=a[i]+a[i+1];
        int st=i+2,mij,dr=n;
        while(st<=dr)
         {
          mij=(st+dr)/2;
          if(a[mij]==v)
            break;
           else
             if(a[mij]<v)
               st=mij+1;
               else
                dr=mij-1;
         }
        if(st==dr||(st!=i+2||dr!=n))
         {
          nr=nr+(n-st)+1;
         }
         else if(a[mij]==v)
               nr=nr+(n-mij)+1;

       }
    printf("%d",nr);
}

int main()
{

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

return 0;
}