#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define eb emplace_back

using namespace std;
using LL = long long;

struct Fenwick {
  vector<int> tr;
  Fenwick(int n = 0) {
    tr.resize(n + 1);
  }
  void add(int x, int v) {
    for (; x < tr.size(); x += x & -x) tr[x] += v;
  }
  int ask(int x) {
    int ans = 0;
    for (; x; x -= x & -x) ans += tr[x];
    return ans;
  }
  int ask(int l, int r) { return ask(r) - ask(l - 1); }
};

namespace FloatingMoon {
  void main() {
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1, 1);
    for (int i = 1; i <= n; i++) cin >> a[i], a[i] = n - a[i] + 1;
    vector<vector<int>> mp(n + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        if (a[i] < a[j]) mp[i][a[j]] = 1;
      }
    }
    // for (int i = 1; i <= n; i++) {
    //   for (int j = 1; j <= n; j++) {
    //     clog << mp[i][j];
    //   }
    //   clog << '\n';
    // }
    // for (int i = 1; i <= n; i++) clog << a[i] << " \n"[i == n];
    Fenwick bit(n);
    LL ans = a[1] != n;
    if (a[1] < n && b[a[1] + 1] == 1) bit.add(a[1] + 1, 1);
    if (a[1] > 1 && b[a[1] - 1] == 0) bit.add(a[1], -1);
    b[a[1]] = 0;
    for (int i = 2; i <= n; i++) {
      int sum = a[i] > a[i - 1] ? 0 : bit.ask(a[i] + 1, a[i - 1]) + (b[a[i] + 1] == 1 && b[a[i]] == 1);
      if (a[i] < n && b[a[i] + 1] == 1) bit.add(a[i] + 1, 1);
      if (a[i] > 1 && b[a[i] - 1] == 0) bit.add(a[i], -1);
      b[a[i]] = 0;
      ans += sum;
    }
    cout << ans << '\n';
  }
}

int main() {
  // freopen("input.in", "r", stdin);
  cin.tie(0)->sync_with_stdio(0);
  FloatingMoon::main();
  return 0;
}