#include <iostream>;
#include <math.h>;
#include <algorithm>;
#include <stdio.h>;
using namespace std;
int f[1000001];
int g[1000001];
int main()
{
    //freopen("rqp.in","r",stdin);
    //freopen("rqp.out","w",stdout);

    long long a,b,d,e,z,j,i,x;
    b=0;
    cin>>a;
    for (i=1; i<=a; i++)
    {
        cin>>f[i];
        if (f[i]==1) x=i;
    }
    for (j=x; j<=a; j++)
    for (i=x; i>=1; i--)

        {
            for (z=i; z<=j; z++)
                g[z]=f[z];
            sort(g+i,g+j);
            if (g[j]==1+j-i) b++;
        }

        cout<<b;

    return 0;
}