#include <bits/stdc++.h>

using namespace std;
int cautare_bin (auto &a, int sum)
{
    int i=0;
    for(int step= (1<<19); step>0; step=step/2)
    {
        if(step+i<a.size() && a[step+i] <= sum  )
            i+=step;
    }
    return i+1;
}

int main()
{
    ifstream f("nrtri.in");
    ofstream g("nrtri.out");
    int n,moduri=0,sum=0;
    f>>n;
    vector<int> a(n+1,0);
    for(int i=1; i<=n; i++)
    {
        f>>a[i];
    }
    sort(a.begin(),a.end());
    for(int i=1; i<=n; i++)
    {
        for(int j=i+1; j<=n; ++j)
        {
            sum=a[i]+a[j];
            int k= cautare_bin(a,sum);
            moduri=moduri+k;
            cout<<moduri<<endl;
            moduri-=j+1;
            cout<<moduri<<endl;

        }
    }
    g<<moduri;
    return 0;
}
/*#include <bits/stdc++.h>
using namespace std;
int caut_bin(vector<int> &v, int x)
{
int i=0;
for(int step = (2<<19); step>0; step/=2)
{
if(i+step < v.size() && v[i+step] < x)
{
i+=step;
}
}
return i+1;
}
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n=0, moduri=0;
f>>n;
vector<int> a(n,0);
for(int i=0; i<n; ++i)
{
f>>a[i];
}
sort(a.begin(),a.end());
for(int i=0; i<n; ++i)
{
for(int j=i+1; j<n; ++j)
{
moduri+=caut_bin(a,a[i]+a[j]+1);
moduri-=j+1;
}
}
g<<moduri;
return 0;
}*/