#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int AS = 200200;
pair<int, int> DAT[2 * AS];
int dat[2 * AS];
pair<int, int> keisan(pair<int, int> A, pair<int, int> B) {
	if (A > B) swap(A, B);
	if (A.second > B.first) swap(A.second, B.first);
	return A;
}
void modify(int p, int value) {
	for (DAT[p += AS] = { value, 2e9 }; p > 1; p >>= 1) {
		auto tmp = keisan(DAT[p], DAT[p ^ 1]);
		DAT[p >> 1] = tmp;
	}
}

pair<int, int> query(int l, int r) {
	pair<int, int> ret = { 2e9,2e9 };
	for (l += AS, r += AS; l < r; l >>= 1, r >>= 1) {
		if (l & 1) ret = keisan(ret, DAT[l++]);
		if (r & 1) ret = keisan(ret, DAT[--r]);
	}
	return ret;
}
void modify2(int p, int value) {
	for (dat[p += AS] = value; p > 1; p >>= 1) dat[p >> 1] = max(dat[p], dat[p ^ 1]);
}
int query2(int l, int r) {
	int ret = 0;
	for (l += AS, r += AS; l < r; l >>= 1, r >>= 1) {
		if (l & 1) chmax(ret, dat[l++]);
		if (r & 1) chmax(ret, dat[--r]);
	}
	return ret;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;
	rep(i, 2 * AS) {
		DAT[i] = { 2e9,2e9 };
	}
	rep(i, N) {
		int a;
		cin >> a;
		modify(i, a);
		modify2(i, a);
	}

	ll kotae = 0;
	rep(i, N - 1) {
		int L = i + 1, R = N;
		while (L + 1 < R) {
			int wj = (L + R) / 2;
			auto p = query(i, wj + 1);

			ll dore = ll(query2(i, wj + 1)) - p.first - p.second;
			if (dore <= 0) L = wj;
			else R = wj;
		}
		kotae += L - i;
	}
	co(kotae);

	Would you please return 0;
}