#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=LONG_MAX;
const ll mod=MOD;
const ll MAX=20000010;

//SegmentTree
template< typename Monoid >
struct SegmentTree
{
  using F = function< Monoid(Monoid, Monoid) >;
 
  int sz;
  vector< Monoid > seg;
 
  const F f;
  const Monoid M1;
 
  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1)
  {
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }
 
  void set(int k, const Monoid &x)
  {
    seg[k + sz] = x;
  }
 
  void build()
  {
    for(int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
 
  void update(int k, const Monoid &x)
  {
    k += sz;
    seg[k] = x;
    while(k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
 
  Monoid query(int a, int b)
  {
    Monoid L = M1, R = M1;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) L = f(L, seg[a++]);
      if(b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }
 
  Monoid operator[](const int &k) const
  {
    return seg[k + sz];
  }
};


signed main(){
    ll n;cin>>n;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    SegmentTree<pll>small(n,[](pll a,pll b){
        pll c;
        if(a.fi<b.fi){
            c.fi=a.fi;
            c.se=min(b.fi,a.se);
        }else{
            c.fi=b.fi;
            c.se=min(a.fi,b.se);
        }
        return c;},mp(inf,inf));
    SegmentTree<ll>big(n,[](ll a,ll b){return max(a,b);},-1);
    rep(i,n){
        small.update(i,mp(a[i],inf));
        big.update(i,a[i]);
    }
    ll ans=0;
    REP(i,1,n){
        pll c=small.query(0,i+1);
        ll d=big.query(0,i+1);
        if(d<=c.fi+c.se){
            ans+=i;
            continue;
        }
        ll l=0,r=i-1;
        while(r-l>1){
            ll mid=(r+l)/2;
            pll cc=small.query(mid,i+1);
            ll dd=big.query(mid,i+1);
            if(dd<=cc.fi+cc.se){
                r=mid;
            }else{
                l=mid;
            }
        }
        ans+=i-r;
    }
    cout<<ans<<endl;
}