#include <bits/stdc++.h>

using namespace std;
using ll = long long;

template<class S, S (*op)(S, S), S (*e)()>struct SegTree {
    vector<S> seg;
    int N = 1;

    SegTree (ll n) : SegTree(vector<S>(n, e())) {}
    SegTree (const vector<S> &v){
        ll n = v.size();
        while (N < n) N *= 2;
        seg.resize(N*2-1, e());
        for (ll i=0; i<n; i++) seg[i+N-1] = v[i];
        for (ll i=N-2; i>=0; i--){
            seg[i] = op(seg[i*2+1], seg[i*2+2]);
        }
    }

    void set(int loc, S val){
        loc += N-1;
        seg[loc] = val;
        while (loc != 0){
            loc = (loc-1)/2;
            seg[loc] = op(seg[loc*2+1], seg[loc*2+2]);
        }
    }

    //op(a[l], ..., a[r])
    S prod (int l, int r) const{
        return _prod(l, r, 0, 0, N-1);
    }

    S all_prod() const{
        return seg[0];
    }

    S _prod (int l, int r, int idx, int bitl, int bitr) const{
        if (r < bitl || l > bitr) return e();
        if (l <= bitl && bitr <= r) return seg[idx];

        ll bitm = (bitl+bitr)/2;
        return op(_prod(l, r, idx*2+1, bitl, bitm), _prod(l, r, idx*2+2, bitm+1, bitr));
    }

    S get (int i) const{
        return seg[i+N-1];
    }

    void show() const{
        for (int i=N-1; i<N*2-1; i++) cout << seg[i] << " ";
        cout << endl;
    }
};


const int INF = 1e9+1;

struct S{
    int m1;
    int m2;
};

S op1(S a, S b){
    vector<int> v(4);
    /*
    v[0] = a.m1, v[1] = a.m2, v[2] = b.m1, v[3] = b.m2;
    sort(v.begin(), v.end());
    */
    return a;
}

S e1(){
    return {INF, INF};
}

int op2(int a, int b){
    return max(a, b);
}

int e2(){
    return -INF;
}
 
int main(){
 
    int N, x, mx;
    cin >> N;
    S mi;
    vector<int> a(N);
    vector<S> b(N);
    ll ans=0;

    for (int i=0; i<N; i++){
        cin >> x;
        a[i] = x;
        b[i] = {x, INF};
    }
    SegTree<int, op2, e2> tmx(a);
    SegTree<S, op1, e1> tmi(b);

    for (int i=0; i<N-1; i++){
        int l=i+1, r=N, c;
        while(r-l>1){
            c = (l+r)/2;
            mi = tmi.prod(i, c);
            mx = tmx.prod(i, c);
            if (mx <= mi.m1 + mi.m2) l=c;
            else r=c;
        }
        ans += l-i;
    }

    cout << ans << endl;

    return 0;
}