#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

void Main() {
  ll n;
  R n;
  ll a[n];
  rep(i,n) R a[i];
  ll d1[n],d2[n];
  mem(d1);mem(d2);
  ll c=0;
  c=0;
  REP(i,1,n) {
    if(a[i-1]<a[i]) c++;
    else c=0;
    d1[i]=max(d1[i],c);
  }
  rrep(i,n-1) {
    if(a[i]>a[i+1]) c++;
    else c=0;
    d2[i]=max(d2[i],c);
  }
  vector<P> d;
  rep(i,n) d.pb(P(max(d1[i],d2[i]),i));
  sort(all(d),greater<P>());
  if(d[0].F==d[1].F||d[0].F%2||d1[d[0].S]!=d2[d[0].S]) pr(0);
  else pr(1);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
