#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
template <class T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <class T>
void chkmin(T &x, const T &y) {
  if (x > y) x = y;
}
using ll = long long;
const int N = 5e5 + 10;

int n;
ll h[N];
std::pair<ll, ll> s[N];

int tg[N * 25], tr[N * 25], ls[N * 25], rs[N * 25], ntot = 1, rt = 1;
void get_down(int &i, int t) {
  if (!i) i = ++ntot;
  tr[i] += t, tg[i] += t;
}
void push_down(int i) {
  if (tg[i]) get_down(ls[i], tg[i]), get_down(rs[i], tg[i]), tg[i] = 0;
}
void add(int &i, ll l, ll r, ll ql, ll qr, int v) {
  if (ql > qr) return;
  if (!i) i = ++ntot;
  if (ql <= l && r <= qr) return get_down(i, v);
  ll mid = (l + r) >> 1;
  push_down(i);
  if (ql <= mid) add(ls[i], l, mid, ql, qr, v);
  if (qr > mid) add(rs[i], mid + 1, r, ql, qr, v);
  tr[i] = std::min(tr[ls[i]], tr[rs[i]]);
}

int main() {
  std::cin.tie(0)->sync_with_stdio(0);
  std::cin >> n;
  for (int i = 1; i <= n; i++) std::cin >> h[i], h[i] *= 2;
  for (int i = 2; i < n; i++) {
    ll v1 = (h[i - 1] + h[i]) / 2;
    s[i] = {-2e12, 2e12};
    if (h[i] < h[i - 1]) chkmax(s[i].first, v1);
    if (h[i] > h[i - 1]) chkmin(s[i].second, v1 - 1);
    ll v2 = (h[i] + h[i + 1]) / 2;
    if (h[i] < h[i + 1]) chkmax(s[i].first, v2);
    if (h[i] > h[i + 1]) chkmin(s[i].second, v2 - 1);
  }
  std::vector<ll> v;
  for (int i = 2; i < n; i++) v.push_back(s[i].first), v.push_back(s[i].second);
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
  for (int i = 2; i < n; i++) {
    s[i].first = std::lower_bound(v.begin(), v.end(), s[i].first) - v.begin();
    s[i].second = std::lower_bound(v.begin(), v.end(), s[i].second) - v.begin();
  }
  int m = v.size() - 1;
  ll ans = n - 1;
  for (int i = 2, j = 1; i < n; ) {
    if (j < i - 1) j = i - 1;
    for (;;) {
      if (j == n - 1) break;
      j++;
      add(rt, 0, m, s[j].first, s[j].second, 1);
      if (tr[rt]) {
        add(rt, 0, m, s[j].first, s[j].second, -1);
        j--;
        break;
      }
    }
    ans += j - i + 1;
    if (j >= i) add(rt, 0, m, s[i].first, s[i].second, -1);
    i++;
  }
  std::cout << ans << '\n';

}