#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) for(int qq123_=(n);qq123_;qq123_--)
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll lcm(ll i, ll j) { return i / gcd(i, j) * j; }
ll mod_pow(ll x, ll n, ll p = mod) {
    ll res = 1; x %= p;
    while (n > 0) {
        if (n & 1) res = res * x % p;
        x = x * x % p;
        n >>= 1;
    }
    return res;
}//x^n%p
ll bitcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
    if (!fact_[0]) {
        fact_[0] = 1; comp_[0] = 1;
        for (int i = 1; i < fn_; i++)
            fact_[i] = fact_[i - 1] * i % Mod;
        comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
        for (int i = fn_ - 2; i > 0; i--)
            comp_[i] = comp_[i + 1] * (i + 1) % Mod;
    }
    if (x < y) return 0;
    return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
int n, m, sq;
int a[200000];
vec<int>d[1000];
vec<int>e[1000][2];
H rang[1000];
signed main() {
    cin >> n;
    sq = sqrt(n);
    rep(i, n) {
        a[i] = read();
        d[i / sq].pb(a[i]);
    }
    m = (n - 1) / sq + 1;
    rep(i, m) rang[i] = H{ i * sq,min((i + 1) * sq,n) };
    rep(i, m) {
        sort(all(d[i]));
        e[i][0].pb(0);
        e[i][1].pb(0);
        for (auto g : d[i]) {
            int t = g, sum = 0;
            rng(j, rang[i].fs, rang[i].sc) {
                if (t >= a[j]) {
                    t = a[j];
                    sum++;
                }
            }
            e[i][0].pb(sum);
            t = g, sum = 0;
            for (int j = rang[i].sc - 1; j >= rang[i].fs; j--) {
                if (t >= a[j]) {
                    t = a[j];
                    sum++;
                }
            }
            e[i][1].pb(sum);
        }
    }
    int ans = 0;
    rep(i, n) {
        int k = i / sq;
        int t = a[i];
        for (int j = i - 1; j >= rang[k].fs; j--) {
            if (a[j] > a[i]) goto loop;
            if (t > a[j]) {
                ans++;
                t = a[j];
            }
        }
        for (int j = k - 1; j >= 0; j--) {
            if (d[j][d[j].size() - 1] > a[i]) {
                for (int z = rang[j].sc - 1; z >= rang[j].fs; z--) {
                    if (a[z] > a[i]) goto loop;
                    if (t > a[z]) {
                        ans++;
                        t = a[z];
                    }
                }
            }
            int r = lower_bound(all(d[j]), t) - d[j].begin();
            ans += e[j][1][r];
            chmin(t, d[j][0]);
        }
    loop:;
        t = a[i];
        for (int j = i + 1; j < rang[k].sc; j++) {
            if (a[j] > a[i]) goto roop;
            if (t > a[j]) {
                ans++;
                t = a[j];
            }
        }
        for (int j = k + 1; j < m; j++) {
            if (d[j][d[j].size() - 1] > a[i]) {
                for (int z = rang[j].fs; z < rang[j].sc; z++) {
                    if (a[z] > a[i]) goto roop;
                    if (t > a[z]) {
                        ans++;
                        t = a[z];
                    }
                }
            }
            int r = lower_bound(all(d[j]), t) - d[j].begin();
            ans += e[j][0][r];
            chmin(t, d[j][0]);
        }
    roop:;
    }
    cout << ans << endl;
}