import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto P = new int[N];
      foreach (i; 0 .. N) {
        P[i] = readInt() - 1;
      }
      
      long ans;
      void solve(int l, int r) {
        if (r - l <= 1) {
          return;
        }
        const mid = (l + r) / 2;
        solve(l, mid);
        solve(mid, r);
        alias Entry = Tuple!(int, "mn", int, "mx");
        Entry[] ps, qs;
        {
          int mn = N, mx = -1;
          foreach_reverse (i; l .. mid) {
            chmax(mx, P[i]);
            if (chmin(mn, P[i])) {
              ps ~= Entry(mn, mx);
            }
          }
        }
        {
          int mn = N, mx = -1;
          foreach (i; mid .. r) {
            chmin(mn, P[i]);
            if (chmax(mx, P[i])) {
              qs ~= Entry(mn, mx);
            }
          }
        }
        debug {
          writeln("ps = ", ps);
          writeln("qs = ", qs);
        }
        foreach (ref p; ps) {
          /*
            q.mx >= p.mx
            q.mn >= p.mn
          */
          const lb = qs.binarySearch!(q => (q.mx >= p.mx));
          const ub = qs.binarySearch!(q => (q.mn < p.mn));
          if (lb < ub) {
            ans += (ub - lb);
          }
        }
      }
      
      foreach (phase; 0 .. 2) {
        solve(0, N);
        P.reverse;
      }
      writeln(ans);
      
      debug {
        long brt;
        foreach (i; 0 .. N) foreach (j; i + 1 .. N) {
          if (P[i] == P[i .. j + 1].minElement && P[j] == P[i .. j + 1].maxElement ||
              P[i] == P[i .. j + 1].maxElement && P[j] == P[i .. j + 1].minElement) {
            ++brt;
          }
        }
        writeln("brt = ", brt);
        assert(brt == ans);
      }
    }
  } catch (EOFException e) {
  }
}