import java.util.Scanner;

public class bst {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt() - 1;
        }

        int[] v = new int[n];
        for (int i = 0; i < n; i++) {
            v[a[i]] = i;
        }

        int[] l = new int[n];
        int[] r = new int[n];
        for (int i = 0; i < n; i++) {
            l[i] = i - 1;
            while (l[i] != -1 && v[i] < v[l[i]]) {
                l[i] = l[l[i]];
            }
        }
        for (int i = n - 1; i >= 0; i--) {
            r[i] = i + 1;
            while (r[i] != n && v[i] < v[r[i]]) {
                r[i] = r[r[i]];
            }
        }

        long ans = 0;
        for (int i = 0; i < n; i++) {
            ans += r[i] - l[i] - 2;
        }
        System.out.println(ans);
    }
}