#include<bits/stdc++.h>
const int N=200005;
using namespace std;
inline void swap(int &x,int &y)
{
x^=y;
y^=x;
x^=y;
}
inline int read()
{
int f=1,x=0;char ch;
do
{
ch=getchar();
if(ch=='-')f=-1;
}
while(ch<'0'||ch>'9');
do
{
x=x*10+ch-'0';
ch=getchar();
}
while(ch>='0'&&ch<='9');
return f*x;
}
int n,a[N],c[N][2],fa[N],size[N],m,rt,top,s[N],ans;
inline void build(int n)
{
for(int i=1;i<=n;i++)
{
for(;top&&a[s[top]]<=a[i];top--) c[i][0]=s[top];
c[s[top]][1]=i;
s[++top]=i;
}
rt=s[1];
}
inline void dfs(int u)
{
size[u]=1;
int flag=1;
if(c[u][0])
{
dfs(c[u][0]);
size[u]+=size[c[u][0]];
if(size[c[u][0]]%3!=0) flag=0;
}
if(c[u][1])
{
dfs(c[u][1]);
size[u]+=size[c[u][1]];
if(size[c[u][1]]%3!=0) flag=0;
}
if((n-size[u])%3==0&&flag) ans++;
}
int main()
{
n=read();
for(int i=1;i<=n;i++) a[i]=read();
build(n);
dfs(rt);
printf("%d\n",ans);
}
const int N=200005;
using namespace std;
inline void swap(int &x,int &y)
{
x^=y;
y^=x;
x^=y;
}
inline int read()
{
int f=1,x=0;char ch;
do
{
ch=getchar();
if(ch=='-')f=-1;
}
while(ch<'0'||ch>'9');
do
{
x=x*10+ch-'0';
ch=getchar();
}
while(ch>='0'&&ch<='9');
return f*x;
}
int n,a[N],c[N][2],fa[N],size[N],m,rt,top,s[N],ans;
inline void build(int n)
{
for(int i=1;i<=n;i++)
{
for(;top&&a[s[top]]<=a[i];top--) c[i][0]=s[top];
c[s[top]][1]=i;
s[++top]=i;
}
rt=s[1];
}
inline void dfs(int u)
{
size[u]=1;
int flag=1;
if(c[u][0])
{
dfs(c[u][0]);
size[u]+=size[c[u][0]];
if(size[c[u][0]]%3!=0) flag=0;
}
if(c[u][1])
{
dfs(c[u][1]);
size[u]+=size[c[u][1]];
if(size[c[u][1]]%3!=0) flag=0;
}
if((n-size[u])%3==0&&flag) ans++;
}
int main()
{
n=read();
for(int i=1;i<=n;i++) a[i]=read();
build(n);
dfs(rt);
printf("%d\n",ans);
}