#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template <typename T>
struct segtree{
    int n;
    T UNIT;
    vector<T> dat;
    T (*calc)(T, T);

    segtree(int n_, T unit, T (*_calc)(T, T)){
        UNIT = unit;
        calc = _calc;
        n = 1;
        while(n < n_) n *= 2;
        dat = vector<T>(2*n);
        for(int i = 0; i < 2*n; i++) dat[i] = UNIT;
    }

    void insert(int k, T a){
        dat[k+n-1] = a;
    }
    void update_all(){
        for(int i = n-2; i >= 0; i--){
            dat[i] = calc(dat[i*2+1], dat[i*2+2]);
        }
    }
    //k番目の値(0-indexed)をaに変更
    void update(int k, T a){
        k += n-1;
        dat[k] = a;
        while(k > 0){
            k = (k-1)/2;
            dat[k] = calc(dat[k*2+1], dat[k*2+2]);
        }
    }

    //[a, b)
    //区間[a, b]へのクエリに対してはquery(a, b+1)と呼ぶ
    T query(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        if(r <= a || b <= l) return UNIT;
        if(a <= l && r <= b) return dat[k];
        else{
            T vl = query(a, b, k*2+1, l, (l+r)/2);
            T vr = query(a, b, k*2+2, (l+r)/2, r);
            return calc(vl, vr);
        }
    }
};

const int INVALID = -1;

struct node{
    int m1, m2, M;
};

node unit = node{INVALID, INVALID, INVALID};

inline bool is_unit(node n){
    return n.m1 == INVALID && n.m2 == INVALID && n.M == INVALID;
}

node calc(node n1, node n2){
    vector<int> v;
    auto add = [&](int x){
        if(x != INVALID) v.push_back(x);
    };
    if(is_unit(n1)) return n2;
    if(is_unit(n2)) return n1;
    int a = min(n1.m1, n2.m1);
    int b = max(n1.m1, n2.m1);
    int c = max({n1.m1, n2.m1, n1.m2, n2.m2, n1.M, n2.M});
    if(n2.m2 != INVALID) chmin(b, n2.m2);
    if(n1.m2 != INVALID) chmin(b, n1.m2);
    return node{a, b, c};
}

bool ok(node n){
    return n.m1+n.m2 >= n.M;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    segtree<node> sgt(n, unit, calc);
    for(int i = 0; i < n; i++){
        int a; cin >> a;
        sgt.update(i, node{a, INVALID, INVALID});
    }
    ll ans = 0;
    auto test = [&](int l, int r){
        auto nd = sgt.query(l, r+1);
        cout << nd.m1 << ' ' << nd.m2 << ' ' << nd.M << ' ';
        cout << (ok(nd) ? "OK" : "NG") << endl;
    };
    

    for(int i = 0; i < n-1; i++){
        if(!ok(sgt.query(i, i+2))) {
            continue;
        }
        if(ok(sgt.query(i, n))) {
            ans += n-i-1;
            continue;
        }
        int l = i+1, r = n-1;
        while(r-l > 1){
            int c = (l+r)/2;
            if(ok(sgt.query(i, c+1))) l = c;
            else r = c; 
        }
        ans += l-i;
    }
    cout << ans << endl;
}