#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    int N;
    cin >> N;
    vector<int> a(N);
    rep(i, N) cin >> a[i];
    multiset<int> s1, s2;
    ll ans = 0;
    s1.insert(a[0]);
    s1.insert(a[1]);
    s2.insert(-a[0]);
    s2.insert(-a[1]);
    int l = 0;
    for (int i = 2; i < N; i++) {
        s1.insert(a[i]);
        s2.insert(-a[i]);
        int m1 = *s1.begin();
        s1.erase(s1.begin());
        int m2 = *s1.begin();
        int M = -*s2.begin();
        //cout << m1 << " " << m2 << " " << M << "\n";
        s1.insert(m1);
        if (M > m1 + m2) {
            ans += (s1.size() - 2) * (s1.size() - 1) / 2;
            while (M > m1 + m2) {
                s1.erase(s1.find(a[l]));
                s2.erase(s2.find((-a[l])));
                l++;
                m1 = *s1.begin();
                s1.erase(s1.begin());
                m2 = *s1.begin();
                M = -*s2.begin();
                s1.insert(m1);
            }
            ans -= (s1.size() - 2) * (s1.size() - 1) / 2;
        }
        //cout << "ans=" << ans << "\n";
    }
    ans += (s1.size() - 1) * s1.size() / 2;
    cout << ans << "\n";
}