#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int > P(N);
  cin >> P;
  vector< int > latte(N), malta(N);
  auto rec = MFP([&](auto rec, int l, int r) -> int64 {
    if(l + 1 >= r) return 0LL;
    int m = (l + r) >> 1;
    int64 ret = rec(l, m) + rec(m, r);
    // 最小   最大
    vector< int > x, y;
    for(int k = m - 1; k >= l; k--) {
      latte[k] = malta[k] = P[k];
      if(k + 1 < m) {
        chmin(latte[k], latte[k + 1]);
        chmax(malta[k], malta[k + 1]);
      }
      if(latte[k] == P[k]) x.emplace_back(k);
    }
    int ptr = 0;
    vector< int > uku;
    for(int k = m; k < r; k++) {
      latte[k] = malta[k] = P[k];
      if(l <= k - 1) {
        chmin(latte[k], latte[k - 1]);
        chmax(malta[k], malta[k - 1]);
      }
      if(malta[k] == P[k]) {
        while(ptr < x.size() && malta[x[ptr]] <= malta[k]) {
          uku.emplace_back(latte[x[ptr]]);
          ++ptr;
        }
        ret += end(uku) - lower_bound(begin(uku), end(uku), latte[k], greater<>());
      }
    }
    return ret;
  });
  int64 beet = rec(0, N);
  reverse(begin(P), end(P));
  cout << beet + rec(0, N) << endl;
}