#include<bits/stdc++.h>

using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")

#define ls i<<1

#define rs ls | 1

#define mid ((ll+rr)>>1)

#define pii pair<int,int>

#define MP make_pair

typedef long long LL;

const long long INF = 1e18+1LL;

const double Pi = acos(-1.0);

const int N = 5e5+, M = 1e2+,inf = 2e9,mod = 1e9+;

int a[N],n,dp1[N],dp2[N];

int main() {

    scanf("%d",&n);

    for(int i = ; i <= n; ++i) scanf("%d",&a[i]);

    for(int i = ; i <= n; ++i) {

        dp1[i] = ;

        dp2[i] = ;

    }

    for(int i = ; i <= n; ++i) {

        if(a[i] > a[i-]) dp1[i] = dp1[i-] + ;

    }

    for(int i = n-; i >= ; --i) {

        if(a[i+] < a[i]) dp2[i] = dp2[i+] + ;

    }

    LL ans = ;

    for(int i = ; i <= n; ++i) ans += max(dp1[i],dp2[i]);

    cout<<ans<<endl;

    return ;

}